/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:08:22,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:08:22,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:08:22,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:08:22,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:08:22,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:08:22,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:08:22,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:08:22,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:08:22,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:08:22,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:08:22,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:08:22,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:08:22,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:08:22,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:08:22,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:08:22,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:08:22,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:08:22,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:08:22,231 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:08:22,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:08:22,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:08:22,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:08:22,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:08:22,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:08:22,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:08:22,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:08:22,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:08:22,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:08:22,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:08:22,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:08:22,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:08:22,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:08:22,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:08:22,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:08:22,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:08:22,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:08:22,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:08:22,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:08:22,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:08:22,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:08:22,247 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:08:22,261 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:08:22,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:08:22,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:08:22,262 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:08:22,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:08:22,263 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:08:22,263 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:08:22,263 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:08:22,263 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:08:22,263 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:08:22,264 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:08:22,264 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:08:22,264 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:08:22,264 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:08:22,264 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:08:22,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:08:22,265 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:08:22,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:08:22,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:08:22,265 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:08:22,265 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:08:22,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:08:22,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:08:22,266 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:08:22,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:08:22,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:08:22,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:08:22,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:08:22,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:08:22,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:08:22,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:08:22,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:08:22,449 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:08:22,449 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:08:22,450 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:08:22,546 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_JJ3YC0/tmp/d632a9c129ed4c29a8cfaab8ef11e4ec/FLAGd88ab04cf [2020-07-01 13:08:22,879 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:08:22,880 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:08:22,881 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:08:22,887 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_JJ3YC0/tmp/d632a9c129ed4c29a8cfaab8ef11e4ec/FLAGd88ab04cf [2020-07-01 13:08:23,276 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_JJ3YC0/tmp/d632a9c129ed4c29a8cfaab8ef11e4ec [2020-07-01 13:08:23,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:08:23,289 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:08:23,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:08:23,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:08:23,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:08:23,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a5338f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23, skipping insertion in model container [2020-07-01 13:08:23,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:08:23,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:08:23,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:08:23,578 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:08:23,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:08:23,614 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:08:23,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23 WrapperNode [2020-07-01 13:08:23,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:08:23,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:08:23,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:08:23,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:08:23,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:08:23,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:08:23,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:08:23,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:08:23,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... [2020-07-01 13:08:23,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:08:23,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:08:23,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:08:23,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:08:23,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:08:23,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:08:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:08:23,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:08:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:08:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:08:23,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:08:24,361 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:08:24,361 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-01 13:08:24,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:24 BoogieIcfgContainer [2020-07-01 13:08:24,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:08:24,367 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:08:24,368 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:08:24,370 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:08:24,370 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:24" (1/1) ... [2020-07-01 13:08:24,391 INFO L313 BlockEncoder]: Initial Icfg 158 locations, 172 edges [2020-07-01 13:08:24,393 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:08:24,393 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:08:24,394 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:08:24,394 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:08:24,396 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:08:24,397 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:08:24,397 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:08:24,435 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:08:24,443 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-01 13:08:24,525 INFO L200 BlockEncoder]: SBE split 92 edges [2020-07-01 13:08:24,532 INFO L70 emoveInfeasibleEdges]: Removed 4 edges and 0 locations because of local infeasibility [2020-07-01 13:08:24,534 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:08:24,576 INFO L100 BaseMinimizeStates]: Removed 28 edges and 14 locations by large block encoding [2020-07-01 13:08:24,579 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-07-01 13:08:24,581 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:08:24,582 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:08:24,587 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding [2020-07-01 13:08:24,588 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:08:24,589 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:08:24,589 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:08:24,590 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:08:24,590 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:08:24,591 INFO L313 BlockEncoder]: Encoded RCFG 140 locations, 331 edges [2020-07-01 13:08:24,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:24 BasicIcfg [2020-07-01 13:08:24,592 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:08:24,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:08:24,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:08:24,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:08:24,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:08:23" (1/4) ... [2020-07-01 13:08:24,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58378747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:08:24, skipping insertion in model container [2020-07-01 13:08:24,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (2/4) ... [2020-07-01 13:08:24,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58378747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:08:24, skipping insertion in model container [2020-07-01 13:08:24,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:24" (3/4) ... [2020-07-01 13:08:24,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58378747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:24, skipping insertion in model container [2020-07-01 13:08:24,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:24" (4/4) ... [2020-07-01 13:08:24,601 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:08:24,612 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:08:24,619 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 84 error locations. [2020-07-01 13:08:24,633 INFO L251 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2020-07-01 13:08:24,657 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:08:24,658 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:08:24,658 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:08:24,658 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:08:24,658 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:08:24,658 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:08:24,658 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:08:24,659 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:08:24,676 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2020-07-01 13:08:24,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:24,683 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:24,684 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:24,684 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:24,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 796805, now seen corresponding path program 1 times [2020-07-01 13:08:24,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:24,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456592317] [2020-07-01 13:08:24,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:24,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456592317] [2020-07-01 13:08:24,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:24,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:24,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648523771] [2020-07-01 13:08:24,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:24,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:24,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:24,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:24,904 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2020-07-01 13:08:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,470 INFO L93 Difference]: Finished difference Result 278 states and 565 transitions. [2020-07-01 13:08:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:25,486 INFO L225 Difference]: With dead ends: 278 [2020-07-01 13:08:25,486 INFO L226 Difference]: Without dead ends: 140 [2020-07-01 13:08:25,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-07-01 13:08:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-07-01 13:08:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-07-01 13:08:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 238 transitions. [2020-07-01 13:08:25,540 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 238 transitions. Word has length 3 [2020-07-01 13:08:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:25,541 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 238 transitions. [2020-07-01 13:08:25,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 238 transitions. [2020-07-01 13:08:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:25,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:25,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:25,544 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:08:25,544 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 796867, now seen corresponding path program 1 times [2020-07-01 13:08:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,545 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10057664] [2020-07-01 13:08:25,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10057664] [2020-07-01 13:08:25,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468358813] [2020-07-01 13:08:25,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:25,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,624 INFO L87 Difference]: Start difference. First operand 140 states and 238 transitions. Second operand 3 states. [2020-07-01 13:08:25,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:25,923 INFO L93 Difference]: Finished difference Result 140 states and 238 transitions. [2020-07-01 13:08:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:25,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:25,925 INFO L225 Difference]: With dead ends: 140 [2020-07-01 13:08:25,925 INFO L226 Difference]: Without dead ends: 134 [2020-07-01 13:08:25,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-01 13:08:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-07-01 13:08:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-01 13:08:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 226 transitions. [2020-07-01 13:08:25,950 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 226 transitions. Word has length 3 [2020-07-01 13:08:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:25,950 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 226 transitions. [2020-07-01 13:08:25,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 226 transitions. [2020-07-01 13:08:25,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:25,951 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:25,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:25,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:08:25,951 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:25,953 INFO L82 PathProgramCache]: Analyzing trace with hash 796869, now seen corresponding path program 1 times [2020-07-01 13:08:25,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:25,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977925368] [2020-07-01 13:08:25,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:25,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977925368] [2020-07-01 13:08:25,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:25,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:25,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430611995] [2020-07-01 13:08:25,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:25,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:25,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:25,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:25,986 INFO L87 Difference]: Start difference. First operand 134 states and 226 transitions. Second operand 3 states. [2020-07-01 13:08:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:26,178 INFO L93 Difference]: Finished difference Result 140 states and 226 transitions. [2020-07-01 13:08:26,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:26,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:26,180 INFO L225 Difference]: With dead ends: 140 [2020-07-01 13:08:26,181 INFO L226 Difference]: Without dead ends: 134 [2020-07-01 13:08:26,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-01 13:08:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2020-07-01 13:08:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-07-01 13:08:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 220 transitions. [2020-07-01 13:08:26,190 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 220 transitions. Word has length 3 [2020-07-01 13:08:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:26,190 INFO L479 AbstractCegarLoop]: Abstraction has 134 states and 220 transitions. [2020-07-01 13:08:26,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 220 transitions. [2020-07-01 13:08:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:08:26,191 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:26,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:08:26,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:08:26,192 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 796870, now seen corresponding path program 1 times [2020-07-01 13:08:26,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:26,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223550086] [2020-07-01 13:08:26,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:26,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223550086] [2020-07-01 13:08:26,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:26,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:26,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695131345] [2020-07-01 13:08:26,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:26,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,243 INFO L87 Difference]: Start difference. First operand 134 states and 220 transitions. Second operand 3 states. [2020-07-01 13:08:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:26,498 INFO L93 Difference]: Finished difference Result 134 states and 220 transitions. [2020-07-01 13:08:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:26,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:08:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:26,500 INFO L225 Difference]: With dead ends: 134 [2020-07-01 13:08:26,500 INFO L226 Difference]: Without dead ends: 128 [2020-07-01 13:08:26,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-07-01 13:08:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2020-07-01 13:08:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-07-01 13:08:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 214 transitions. [2020-07-01 13:08:26,509 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 214 transitions. Word has length 3 [2020-07-01 13:08:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:26,509 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 214 transitions. [2020-07-01 13:08:26,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 214 transitions. [2020-07-01 13:08:26,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:08:26,510 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:26,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:08:26,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:08:26,511 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:26,511 INFO L82 PathProgramCache]: Analyzing trace with hash 24695953, now seen corresponding path program 1 times [2020-07-01 13:08:26,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:26,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032910435] [2020-07-01 13:08:26,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:26,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032910435] [2020-07-01 13:08:26,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:26,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:26,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262523259] [2020-07-01 13:08:26,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:26,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,567 INFO L87 Difference]: Start difference. First operand 128 states and 214 transitions. Second operand 3 states. [2020-07-01 13:08:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:26,802 INFO L93 Difference]: Finished difference Result 128 states and 214 transitions. [2020-07-01 13:08:26,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:26,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:08:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:26,804 INFO L225 Difference]: With dead ends: 128 [2020-07-01 13:08:26,804 INFO L226 Difference]: Without dead ends: 120 [2020-07-01 13:08:26,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-01 13:08:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-01 13:08:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-01 13:08:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 198 transitions. [2020-07-01 13:08:26,811 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 198 transitions. Word has length 4 [2020-07-01 13:08:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:26,811 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 198 transitions. [2020-07-01 13:08:26,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 198 transitions. [2020-07-01 13:08:26,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:08:26,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:26,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:08:26,812 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:08:26,812 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash 24695955, now seen corresponding path program 1 times [2020-07-01 13:08:26,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:26,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960711330] [2020-07-01 13:08:26,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:26,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960711330] [2020-07-01 13:08:26,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:26,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:26,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693278619] [2020-07-01 13:08:26,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:26,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:26,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:26,845 INFO L87 Difference]: Start difference. First operand 120 states and 198 transitions. Second operand 3 states. [2020-07-01 13:08:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:27,034 INFO L93 Difference]: Finished difference Result 128 states and 198 transitions. [2020-07-01 13:08:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:27,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:08:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:27,036 INFO L225 Difference]: With dead ends: 128 [2020-07-01 13:08:27,036 INFO L226 Difference]: Without dead ends: 120 [2020-07-01 13:08:27,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-01 13:08:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-07-01 13:08:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-01 13:08:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 190 transitions. [2020-07-01 13:08:27,042 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 190 transitions. Word has length 4 [2020-07-01 13:08:27,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:27,042 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 190 transitions. [2020-07-01 13:08:27,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 190 transitions. [2020-07-01 13:08:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:08:27,043 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:27,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:08:27,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:08:27,044 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 24695956, now seen corresponding path program 1 times [2020-07-01 13:08:27,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:27,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424347827] [2020-07-01 13:08:27,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:27,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424347827] [2020-07-01 13:08:27,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:27,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:27,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620946876] [2020-07-01 13:08:27,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:27,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,092 INFO L87 Difference]: Start difference. First operand 120 states and 190 transitions. Second operand 3 states. [2020-07-01 13:08:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:27,309 INFO L93 Difference]: Finished difference Result 120 states and 190 transitions. [2020-07-01 13:08:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:27,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:08:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:27,311 INFO L225 Difference]: With dead ends: 120 [2020-07-01 13:08:27,311 INFO L226 Difference]: Without dead ends: 112 [2020-07-01 13:08:27,312 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-07-01 13:08:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-07-01 13:08:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-01 13:08:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 182 transitions. [2020-07-01 13:08:27,316 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 182 transitions. Word has length 4 [2020-07-01 13:08:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:27,316 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 182 transitions. [2020-07-01 13:08:27,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 182 transitions. [2020-07-01 13:08:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:08:27,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:27,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:27,317 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:08:27,318 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 765567162, now seen corresponding path program 1 times [2020-07-01 13:08:27,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:27,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489536055] [2020-07-01 13:08:27,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:27,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489536055] [2020-07-01 13:08:27,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:27,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:27,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218617062] [2020-07-01 13:08:27,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:27,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,360 INFO L87 Difference]: Start difference. First operand 112 states and 182 transitions. Second operand 3 states. [2020-07-01 13:08:27,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:27,543 INFO L93 Difference]: Finished difference Result 112 states and 182 transitions. [2020-07-01 13:08:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:27,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:08:27,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:27,544 INFO L225 Difference]: With dead ends: 112 [2020-07-01 13:08:27,544 INFO L226 Difference]: Without dead ends: 102 [2020-07-01 13:08:27,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-01 13:08:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-07-01 13:08:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-07-01 13:08:27,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2020-07-01 13:08:27,549 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 5 [2020-07-01 13:08:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:27,550 INFO L479 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2020-07-01 13:08:27,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:27,550 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2020-07-01 13:08:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:08:27,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:27,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:27,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:08:27,551 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 765567164, now seen corresponding path program 1 times [2020-07-01 13:08:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:27,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405590622] [2020-07-01 13:08:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:27,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405590622] [2020-07-01 13:08:27,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:27,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:27,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619686820] [2020-07-01 13:08:27,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:27,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:27,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,593 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand 3 states. [2020-07-01 13:08:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:27,798 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2020-07-01 13:08:27,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:27,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:08:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:27,802 INFO L225 Difference]: With dead ends: 102 [2020-07-01 13:08:27,802 INFO L226 Difference]: Without dead ends: 92 [2020-07-01 13:08:27,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-01 13:08:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-07-01 13:08:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-01 13:08:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2020-07-01 13:08:27,806 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 5 [2020-07-01 13:08:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:27,807 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2020-07-01 13:08:27,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2020-07-01 13:08:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:08:27,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:27,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:08:27,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:08:27,808 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:27,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:27,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2037231700, now seen corresponding path program 1 times [2020-07-01 13:08:27,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:27,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160375837] [2020-07-01 13:08:27,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:27,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160375837] [2020-07-01 13:08:27,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:27,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:27,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658067549] [2020-07-01 13:08:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:27,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:27,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:27,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:27,841 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand 3 states. [2020-07-01 13:08:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:27,998 INFO L93 Difference]: Finished difference Result 92 states and 142 transitions. [2020-07-01 13:08:27,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:27,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:08:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:27,999 INFO L225 Difference]: With dead ends: 92 [2020-07-01 13:08:27,999 INFO L226 Difference]: Without dead ends: 86 [2020-07-01 13:08:28,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-01 13:08:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-07-01 13:08:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-01 13:08:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2020-07-01 13:08:28,003 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 6 [2020-07-01 13:08:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,003 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2020-07-01 13:08:28,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2020-07-01 13:08:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:08:28,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:28,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:08:28,004 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2037231698, now seen corresponding path program 1 times [2020-07-01 13:08:28,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603015340] [2020-07-01 13:08:28,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603015340] [2020-07-01 13:08:28,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590362090] [2020-07-01 13:08:28,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:28,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,030 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand 3 states. [2020-07-01 13:08:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:28,141 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2020-07-01 13:08:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:28,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:08:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:28,143 INFO L225 Difference]: With dead ends: 92 [2020-07-01 13:08:28,143 INFO L226 Difference]: Without dead ends: 86 [2020-07-01 13:08:28,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-01 13:08:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-07-01 13:08:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-01 13:08:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2020-07-01 13:08:28,146 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 6 [2020-07-01 13:08:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,147 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2020-07-01 13:08:28,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2020-07-01 13:08:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:08:28,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:28,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:08:28,148 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:28,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2037231697, now seen corresponding path program 1 times [2020-07-01 13:08:28,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109915608] [2020-07-01 13:08:28,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109915608] [2020-07-01 13:08:28,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075955933] [2020-07-01 13:08:28,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:28,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,182 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand 3 states. [2020-07-01 13:08:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:28,332 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2020-07-01 13:08:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:28,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:08:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:28,334 INFO L225 Difference]: With dead ends: 86 [2020-07-01 13:08:28,334 INFO L226 Difference]: Without dead ends: 80 [2020-07-01 13:08:28,334 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-01 13:08:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-01 13:08:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-01 13:08:28,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2020-07-01 13:08:28,337 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 6 [2020-07-01 13:08:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,337 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2020-07-01 13:08:28,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2020-07-01 13:08:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:08:28,338 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:28,338 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:08:28,338 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1270320429, now seen corresponding path program 1 times [2020-07-01 13:08:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058943968] [2020-07-01 13:08:28,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058943968] [2020-07-01 13:08:28,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127382237] [2020-07-01 13:08:28,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:28,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,366 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand 3 states. [2020-07-01 13:08:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:28,499 INFO L93 Difference]: Finished difference Result 80 states and 118 transitions. [2020-07-01 13:08:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:28,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:08:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:28,500 INFO L225 Difference]: With dead ends: 80 [2020-07-01 13:08:28,500 INFO L226 Difference]: Without dead ends: 68 [2020-07-01 13:08:28,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-01 13:08:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-01 13:08:28,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-01 13:08:28,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2020-07-01 13:08:28,503 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 7 [2020-07-01 13:08:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,503 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2020-07-01 13:08:28,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2020-07-01 13:08:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:08:28,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:28,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:08:28,505 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1270320431, now seen corresponding path program 1 times [2020-07-01 13:08:28,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084825119] [2020-07-01 13:08:28,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084825119] [2020-07-01 13:08:28,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296940468] [2020-07-01 13:08:28,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:28,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,529 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand 3 states. [2020-07-01 13:08:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:28,601 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2020-07-01 13:08:28,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:28,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:08:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:28,603 INFO L225 Difference]: With dead ends: 80 [2020-07-01 13:08:28,603 INFO L226 Difference]: Without dead ends: 68 [2020-07-01 13:08:28,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-01 13:08:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-01 13:08:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-01 13:08:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2020-07-01 13:08:28,605 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 7 [2020-07-01 13:08:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,606 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2020-07-01 13:08:28,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2020-07-01 13:08:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:08:28,606 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:08:28,607 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,607 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:08:28,607 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr66REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr68REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr64REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr72REQUIRES_VIOLATION, ULTIMATE.startErr51REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr70REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr56REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr77REQUIRES_VIOLATION, ULTIMATE.startErr79REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr75REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr83REQUIRES_VIOLATION, ULTIMATE.startErr62REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr58REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr60REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr81REQUIRES_VIOLATION, ULTIMATE.startErr67REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr65REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr50REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr52REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr73REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr69REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr71REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr57REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr78REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr74REQUIRES_VIOLATION, ULTIMATE.startErr76REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr55REQUIRES_VIOLATION, ULTIMATE.startErr61REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr82REQUIRES_VIOLATION, ULTIMATE.startErr63REQUIRES_VIOLATION, ULTIMATE.startErr80REQUIRES_VIOLATION, ULTIMATE.startErr59REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2020-07-01 13:08:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1270320432, now seen corresponding path program 1 times [2020-07-01 13:08:28,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349645960] [2020-07-01 13:08:28,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349645960] [2020-07-01 13:08:28,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527069123] [2020-07-01 13:08:28,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:08:28,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,641 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 3 states. [2020-07-01 13:08:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:28,738 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2020-07-01 13:08:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:28,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 13:08:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:08:28,739 INFO L225 Difference]: With dead ends: 68 [2020-07-01 13:08:28,739 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:08:28,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:08:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:08:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:08:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:08:28,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-07-01 13:08:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:08:28,741 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:08:28,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:08:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:08:28,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:08:28,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 13:08:28,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:08:28,748 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr59REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,748 INFO L268 CegarLoopResult]: For program point L27(lines 27 28) no Hoare annotation was computed. [2020-07-01 13:08:28,748 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr55REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,748 INFO L268 CegarLoopResult]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr51REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr47REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr43REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr39REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point L11-3(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point L28-1(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point L28-3(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point L28-4(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr80REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr76REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr72REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr68REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr64REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr60REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr56REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point L29-2(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr52REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2020-07-01 13:08:28,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr48REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L21-3(lines 20 23) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L21-4(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L21-5(lines 21 23) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr44REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L21-7(lines 20 23) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr40REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr36REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point L30-3(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point L30-4(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,754 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr81REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point L22-3(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr77REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point L22-4(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr73REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,755 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr69REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr65REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr61REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr57REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,756 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr53REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr49REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr45REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr41REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr37REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,757 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point L32-1(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point L32-2(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point L32-4(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point L32-5(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point L32-6(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,758 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr82REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr78REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr74REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr70REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr66REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr62REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,759 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr58REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr54REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr50REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point L25-2(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point L25-3(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr46REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point L25-5(lines 25 34) no Hoare annotation was computed. [2020-07-01 13:08:28,760 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr42REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point L25-8(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point L25-9(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point L25-10(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point L25-11(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr38REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point L25-13(lines 25 34) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 29) no Hoare annotation was computed. [2020-07-01 13:08:28,761 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point L26(lines 26 33) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr83REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point L26-2(lines 5 35) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point L26-3(lines 26 33) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point L26-5(lines 5 35) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:08:28,762 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr79REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr75REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr71REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr67REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 13:08:28,763 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr63REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 13:08:28,767 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:08:28,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:28 BasicIcfg [2020-07-01 13:08:28,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:08:28,770 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:08:28,770 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:08:28,773 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:08:28,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:28,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:08:23" (1/5) ... [2020-07-01 13:08:28,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ae9285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:28, skipping insertion in model container [2020-07-01 13:08:28,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:28,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:08:23" (2/5) ... [2020-07-01 13:08:28,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ae9285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:28, skipping insertion in model container [2020-07-01 13:08:28,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:28,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:08:24" (3/5) ... [2020-07-01 13:08:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ae9285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:28, skipping insertion in model container [2020-07-01 13:08:28,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:28,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:08:24" (4/5) ... [2020-07-01 13:08:28,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@45ae9285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:28, skipping insertion in model container [2020-07-01 13:08:28,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:28,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:28" (5/5) ... [2020-07-01 13:08:28,778 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:08:28,798 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:08:28,798 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:08:28,799 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:08:28,799 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:08:28,799 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:08:28,799 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:08:28,799 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:08:28,799 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:08:28,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2020-07-01 13:08:28,813 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2020-07-01 13:08:28,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:28,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:28,819 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,819 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:28,820 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:08:28,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states. [2020-07-01 13:08:28,824 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2020-07-01 13:08:28,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:28,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:28,825 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:28,825 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-01 13:08:28,830 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRYtrue [781] ULTIMATE.startENTRY-->L38: Formula: (and (= (store |v_#valid_124| 0 0) |v_#valid_123|) (< 0 |v_#StackHeapBarrier_4|) (= 0 |v_#NULL.base_2|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #valid=|v_#valid_124|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_123|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_6|, #NULL.base=|v_#NULL.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet19, #NULL.base] 111#L38true [511] L38-->L11: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse3 |v_ULTIMATE.start_f_#t~malloc3.base_1| 1))) (and (= v_ULTIMATE.start_f_~z~0.base_1 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc1.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.base_1 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (= v_ULTIMATE.start_f_~d_ref~0.offset_1 |v_ULTIMATE.start_f_#t~malloc0.offset_1|) (= v_ULTIMATE.start_f_~k~0.offset_1 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_f_#t~malloc1.base_1|)) (= (store .cse1 |v_ULTIMATE.start_f_#t~malloc4.base_1| 1) |v_#valid_3|) (< 0 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= v_ULTIMATE.start_f_~x~0.offset_1 |v_ULTIMATE.start_f_#t~malloc1.offset_1|) (= v_ULTIMATE.start_f_~y~0.offset_1 |v_ULTIMATE.start_f_#t~malloc2.offset_1|) (< |v_ULTIMATE.start_main_#t~nondet19_3| 0) (= 0 (select .cse2 |v_ULTIMATE.start_f_#t~malloc2.base_1|)) (= 0 (select .cse1 |v_ULTIMATE.start_f_#t~malloc4.base_1|)) (> 0 |v_ULTIMATE.start_f_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~k~0.base_1 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc4.base_1|) (= v_ULTIMATE.start_f_~d_1 |v_ULTIMATE.start_f_#in~d_1|) (= 0 (select |v_#valid_8| |v_ULTIMATE.start_f_#t~malloc0.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc1.offset_1| 0) (< 0 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= v_ULTIMATE.start_f_~y~0.base_1 |v_ULTIMATE.start_f_#t~malloc2.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_f_#t~malloc3.base_1|)) (= |v_ULTIMATE.start_f_#t~malloc2.offset_1| 0) (= |v_ULTIMATE.start_f_#in~d_1| 1) (= v_ULTIMATE.start_f_~x~0.base_1 |v_ULTIMATE.start_f_#t~malloc1.base_1|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_f_#t~malloc0.base_1| 4) |v_ULTIMATE.start_f_#t~malloc1.base_1| 4) |v_ULTIMATE.start_f_#t~malloc2.base_1| 4) |v_ULTIMATE.start_f_#t~malloc3.base_1| 4) |v_ULTIMATE.start_f_#t~malloc4.base_1| 4) |v_#length_1|) (< 0 |v_ULTIMATE.start_f_#t~malloc3.base_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc3.offset_1|) (= v_ULTIMATE.start_f_~z~0.offset_1 |v_ULTIMATE.start_f_#t~malloc4.offset_1|) (= 0 |v_ULTIMATE.start_f_#t~malloc4.offset_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_3|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_1, ULTIMATE.start_f_#t~malloc1.offset=|v_ULTIMATE.start_f_#t~malloc1.offset_1|, ULTIMATE.start_f_#in~d=|v_ULTIMATE.start_f_#in~d_1|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_1, ULTIMATE.start_f_#t~malloc4.offset=|v_ULTIMATE.start_f_#t~malloc4.offset_1|, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_1, ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_1|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_1|, ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_1|, ULTIMATE.start_f_#t~mem9=|v_ULTIMATE.start_f_#t~mem9_1|, ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_1|, ULTIMATE.start_f_#t~malloc2.offset=|v_ULTIMATE.start_f_#t~malloc2.offset_1|, #length=|v_#length_1|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_1, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_1, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_1, ULTIMATE.start_f_#t~nondet15=|v_ULTIMATE.start_f_#t~nondet15_1|, ULTIMATE.start_f_#t~nondet12=|v_ULTIMATE.start_f_#t~nondet12_1|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_1, ULTIMATE.start_f_#t~mem16=|v_ULTIMATE.start_f_#t~mem16_1|, ULTIMATE.start_f_#t~mem17=|v_ULTIMATE.start_f_#t~mem17_1|, ULTIMATE.start_f_#t~mem18=|v_ULTIMATE.start_f_#t~mem18_1|, ULTIMATE.start_f_#t~short11=|v_ULTIMATE.start_f_#t~short11_1|, ULTIMATE.start_f_#t~mem13=|v_ULTIMATE.start_f_#t~mem13_1|, ULTIMATE.start_f_#t~mem14=|v_ULTIMATE.start_f_#t~mem14_1|, ULTIMATE.start_f_#t~malloc3.base=|v_ULTIMATE.start_f_#t~malloc3.base_1|, ULTIMATE.start_f_#t~malloc4.base=|v_ULTIMATE.start_f_#t~malloc4.base_1|, ULTIMATE.start_f_#t~malloc3.offset=|v_ULTIMATE.start_f_#t~malloc3.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_f_#t~malloc0.offset=|v_ULTIMATE.start_f_#t~malloc0.offset_1|, ULTIMATE.start_f_#t~mem10=|v_ULTIMATE.start_f_#t~mem10_1|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_1, #valid=|v_#valid_3|, ULTIMATE.start_f_#t~malloc0.base=|v_ULTIMATE.start_f_#t~malloc0.base_1|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_1, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_1, ULTIMATE.start_main_#t~nondet19=|v_ULTIMATE.start_main_#t~nondet19_2|, ULTIMATE.start_f_#t~malloc1.base=|v_ULTIMATE.start_f_#t~malloc1.base_1|, ULTIMATE.start_f_#t~malloc2.base=|v_ULTIMATE.start_f_#t~malloc2.base_1|, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_1} AuxVars[] AssignedVars[ULTIMATE.start_f_~x~0.base, ULTIMATE.start_f_#t~malloc1.offset, ULTIMATE.start_f_#in~d, ULTIMATE.start_f_~z~0.offset, ULTIMATE.start_f_#t~malloc4.offset, ULTIMATE.start_f_~d, ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7, ULTIMATE.start_f_#t~mem8, ULTIMATE.start_f_#t~mem9, ULTIMATE.start_f_#t~mem5, ULTIMATE.start_f_#t~malloc2.offset, #length, ULTIMATE.start_f_~z~0.base, ULTIMATE.start_f_~d_ref~0.base, ULTIMATE.start_f_~k~0.offset, ULTIMATE.start_f_#t~nondet15, ULTIMATE.start_f_#t~nondet12, ULTIMATE.start_f_~x~0.offset, ULTIMATE.start_f_#t~mem16, ULTIMATE.start_f_#t~mem17, ULTIMATE.start_f_#t~mem18, ULTIMATE.start_f_#t~short11, ULTIMATE.start_f_#t~mem13, ULTIMATE.start_f_#t~mem14, ULTIMATE.start_f_#t~malloc3.base, ULTIMATE.start_f_#t~malloc4.base, ULTIMATE.start_f_#t~malloc3.offset, ULTIMATE.start_f_#t~malloc0.offset, ULTIMATE.start_f_#t~mem10, ULTIMATE.start_f_~y~0.offset, #valid, ULTIMATE.start_f_#t~malloc0.base, ULTIMATE.start_f_~k~0.base, ULTIMATE.start_f_~y~0.base, ULTIMATE.start_main_#t~nondet19, ULTIMATE.start_f_#t~malloc1.base, ULTIMATE.start_f_#t~malloc2.base, ULTIMATE.start_f_~d_ref~0.offset] 102#L11true [358] L11-->L11-1: Formula: (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_f_~d_ref~0.base_3) v_ULTIMATE.start_f_~d_ref~0.offset_3 v_ULTIMATE.start_f_~d_3))) (<= (+ v_ULTIMATE.start_f_~d_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_f_~d_ref~0.base_3)) (<= 0 v_ULTIMATE.start_f_~d_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_f_~d_ref~0.base_3))) InVars {#valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} OutVars{#valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_f_~d_ref~0.base=v_ULTIMATE.start_f_~d_ref~0.base_3, ULTIMATE.start_f_~d=v_ULTIMATE.start_f_~d_3, ULTIMATE.start_f_~d_ref~0.offset=v_ULTIMATE.start_f_~d_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 98#L11-1true [351] L11-1-->L12: Formula: (and (<= 0 v_ULTIMATE.start_f_~x~0.offset_3) (= (store |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_f_~x~0.base_3) v_ULTIMATE.start_f_~x~0.offset_3 1)) |v_#memory_int_3|) (= 1 (select |v_#valid_11| v_ULTIMATE.start_f_~x~0.base_3)) (<= (+ v_ULTIMATE.start_f_~x~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_f_~x~0.base_3))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_f_~x~0.base=v_ULTIMATE.start_f_~x~0.base_3, #length=|v_#length_9|, ULTIMATE.start_f_~x~0.offset=v_ULTIMATE.start_f_~x~0.offset_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 42#L12true [276] L12-->L13: Formula: (and (= |v_#memory_int_5| (store |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_f_~y~0.base_3) v_ULTIMATE.start_f_~y~0.offset_3 1))) (<= (+ v_ULTIMATE.start_f_~y~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_f_~y~0.base_3)) (<= 0 v_ULTIMATE.start_f_~y~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_f_~y~0.base_3))) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_f_~y~0.base=v_ULTIMATE.start_f_~y~0.base_3, #length=|v_#length_11|, ULTIMATE.start_f_~y~0.offset=v_ULTIMATE.start_f_~y~0.offset_3, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#memory_int] 140#L13true [401] L13-->L14: Formula: (and (<= (+ v_ULTIMATE.start_f_~k~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_f_~k~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_f_~k~0.base_3) v_ULTIMATE.start_f_~k~0.offset_3 1)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_f_~k~0.offset_3) (= 1 (select |v_#valid_15| v_ULTIMATE.start_f_~k~0.base_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_7|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_3, #length=|v_#length_13|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_3, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 86#L14true [334] L14-->L15: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_f_~z~0.base_3)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_3) (= (store |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_f_~z~0.base_3) v_ULTIMATE.start_f_~z~0.offset_3 1)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_f_~z~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_f_~z~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_3, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 18#L15true [795] L15-->L21-3: Formula: (and (= 1 (select |v_#valid_139| v_ULTIMATE.start_f_~k~0.base_23)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_17) (<= (select (select |v_#memory_int_83| v_ULTIMATE.start_f_~k~0.base_23) v_ULTIMATE.start_f_~k~0.offset_17) 1073741823) (<= (+ v_ULTIMATE.start_f_~k~0.offset_17 4) (select |v_#length_107| v_ULTIMATE.start_f_~k~0.base_23))) InVars {#valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} OutVars{ULTIMATE.start_f_#t~mem5=|v_ULTIMATE.start_f_#t~mem5_13|, #valid=|v_#valid_139|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_23, #memory_int=|v_#memory_int_83|, #length=|v_#length_107|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem5] 128#L21-3true [2020-07-01 13:08:28,831 INFO L796 eck$LassoCheckResult]: Loop: 128#L21-3true [389] L21-3-->L21: Formula: (and (= 1 (select |v_#valid_27| v_ULTIMATE.start_f_~z~0.base_6)) (= |v_ULTIMATE.start_f_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_f_~z~0.base_6) v_ULTIMATE.start_f_~z~0.offset_5)) (<= (+ v_ULTIMATE.start_f_~z~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_f_~z~0.base_6)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_5, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6] 12#L21true [249] L21-->L21-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~k~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_f_~k~0.base_9)) (= 1 (select |v_#valid_29| v_ULTIMATE.start_f_~k~0.base_9)) (<= 0 v_ULTIMATE.start_f_~k~0.offset_7) (= |v_ULTIMATE.start_f_#t~mem7_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_f_~k~0.base_9) v_ULTIMATE.start_f_~k~0.offset_7))) InVars {ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_2|, #valid=|v_#valid_29|, ULTIMATE.start_f_~k~0.base=v_ULTIMATE.start_f_~k~0.base_9, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_f_~k~0.offset=v_ULTIMATE.start_f_~k~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem7] 134#L21-1true [397] L21-1-->L22: Formula: (< |v_ULTIMATE.start_f_#t~mem6_6| |v_ULTIMATE.start_f_#t~mem7_6|) InVars {ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_6|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_6|} OutVars{ULTIMATE.start_f_#t~mem6=|v_ULTIMATE.start_f_#t~mem6_5|, ULTIMATE.start_f_#t~mem7=|v_ULTIMATE.start_f_#t~mem7_5|} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem6, ULTIMATE.start_f_#t~mem7] 103#L22true [361] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_f_~z~0.offset_7 4) (select |v_#length_23| v_ULTIMATE.start_f_~z~0.base_9)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_7) (= 1 (select |v_#valid_31| v_ULTIMATE.start_f_~z~0.base_9)) (= |v_ULTIMATE.start_f_#t~mem8_2| (select (select |v_#memory_int_14| v_ULTIMATE.start_f_~z~0.base_9) v_ULTIMATE.start_f_~z~0.offset_7))) InVars {#memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_9, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_2|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_14|, #length=|v_#length_23|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8] 100#L22-1true [783] L22-1-->L21-3: Formula: (and (= 1 (select |v_#valid_125| v_ULTIMATE.start_f_~z~0.base_41)) (<= 0 v_ULTIMATE.start_f_~z~0.offset_29) (= |v_#memory_int_63| (store |v_#memory_int_64| v_ULTIMATE.start_f_~z~0.base_41 (store (select |v_#memory_int_64| v_ULTIMATE.start_f_~z~0.base_41) v_ULTIMATE.start_f_~z~0.offset_29 (* |v_ULTIMATE.start_f_#t~mem8_10| 2)))) (<= (+ v_ULTIMATE.start_f_~z~0.offset_29 4) (select |v_#length_97| v_ULTIMATE.start_f_~z~0.base_41))) InVars {ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_10|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_29, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_64|, #length=|v_#length_97|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_41} OutVars{ULTIMATE.start_f_#t~mem8=|v_ULTIMATE.start_f_#t~mem8_9|, ULTIMATE.start_f_~z~0.offset=v_ULTIMATE.start_f_~z~0.offset_29, #valid=|v_#valid_125|, #memory_int=|v_#memory_int_63|, #length=|v_#length_97|, ULTIMATE.start_f_~z~0.base=v_ULTIMATE.start_f_~z~0.base_41} AuxVars[] AssignedVars[ULTIMATE.start_f_#t~mem8, #memory_int] 128#L21-3true [2020-07-01 13:08:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1937291882, now seen corresponding path program 1 times [2020-07-01 13:08:28,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,833 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404996202] [2020-07-01 13:08:28,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:28,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404996202] [2020-07-01 13:08:28,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:28,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:28,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009585022] [2020-07-01 13:08:28,851 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:08:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash 395690270, now seen corresponding path program 1 times [2020-07-01 13:08:28,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:28,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4191957] [2020-07-01 13:08:28,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:08:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:08:28,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:08:28,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:28,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:28,953 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2020-07-01 13:08:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:29,337 INFO L93 Difference]: Finished difference Result 140 states and 238 transitions. [2020-07-01 13:08:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:29,340 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:08:29,345 INFO L168 Benchmark]: Toolchain (without parser) took 6055.19 ms. Allocated memory was 649.6 MB in the beginning and 782.2 MB in the end (delta: 132.6 MB). Free memory was 562.7 MB in the beginning and 474.3 MB in the end (delta: 88.5 MB). Peak memory consumption was 221.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,345 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:08:29,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.60 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 562.7 MB in the beginning and 654.0 MB in the end (delta: -91.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.70 ms. Allocated memory is still 692.1 MB. Free memory was 654.0 MB in the beginning and 651.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,347 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 ms. Allocated memory is still 692.1 MB. Free memory was 651.3 MB in the beginning and 648.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,348 INFO L168 Benchmark]: RCFGBuilder took 671.76 ms. Allocated memory is still 692.1 MB. Free memory was 648.7 MB in the beginning and 595.1 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,348 INFO L168 Benchmark]: BlockEncodingV2 took 224.75 ms. Allocated memory is still 692.1 MB. Free memory was 595.1 MB in the beginning and 556.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,349 INFO L168 Benchmark]: TraceAbstraction took 4176.33 ms. Allocated memory was 692.1 MB in the beginning and 782.2 MB in the end (delta: 90.2 MB). Free memory was 554.6 MB in the beginning and 574.6 MB in the end (delta: -20.0 MB). Peak memory consumption was 70.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,349 INFO L168 Benchmark]: BuchiAutomizer took 572.35 ms. Allocated memory is still 782.2 MB. Free memory was 574.6 MB in the beginning and 474.3 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:29,352 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 158 locations, 172 edges - StatisticsResult: Encoded RCFG 140 locations, 331 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 324.60 ms. Allocated memory was 649.6 MB in the beginning and 692.1 MB in the end (delta: 42.5 MB). Free memory was 562.7 MB in the beginning and 654.0 MB in the end (delta: -91.3 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 47.70 ms. Allocated memory is still 692.1 MB. Free memory was 654.0 MB in the beginning and 651.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 31.87 ms. Allocated memory is still 692.1 MB. Free memory was 651.3 MB in the beginning and 648.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 671.76 ms. Allocated memory is still 692.1 MB. Free memory was 648.7 MB in the beginning and 595.1 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 224.75 ms. Allocated memory is still 692.1 MB. Free memory was 595.1 MB in the beginning and 556.0 MB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4176.33 ms. Allocated memory was 692.1 MB in the beginning and 782.2 MB in the end (delta: 90.2 MB). Free memory was 554.6 MB in the beginning and 574.6 MB in the end (delta: -20.0 MB). Peak memory consumption was 70.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 572.35 ms. Allocated memory is still 782.2 MB. Free memory was 574.6 MB in the beginning and 474.3 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 84 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 140 locations, 84 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 2305 SDslu, 9 SDs, 0 SdLazy, 2052 SolverSat, 274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 1218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:08:20.039 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_JJ3YC0/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:08:29.589 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check