java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8c3fbe1 [2018-10-22 15:36:00,328 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 15:36:00,331 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 15:36:00,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 15:36:00,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 15:36:00,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 15:36:00,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 15:36:00,353 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 15:36:00,355 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 15:36:00,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 15:36:00,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 15:36:00,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 15:36:00,360 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 15:36:00,361 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 15:36:00,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 15:36:00,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 15:36:00,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 15:36:00,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 15:36:00,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 15:36:00,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 15:36:00,384 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 15:36:00,388 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 15:36:00,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 15:36:00,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 15:36:00,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 15:36:00,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 15:36:00,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 15:36:00,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 15:36:00,397 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 15:36:00,399 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 15:36:00,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 15:36:00,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 15:36:00,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 15:36:00,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 15:36:00,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 15:36:00,405 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 15:36:00,405 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-22 15:36:00,431 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 15:36:00,431 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 15:36:00,432 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 15:36:00,432 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-22 15:36:00,433 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-22 15:36:00,433 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-22 15:36:00,433 INFO L133 SettingsManager]: * Use SBE=true [2018-10-22 15:36:00,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 15:36:00,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 15:36:00,435 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 15:36:00,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 15:36:00,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 15:36:00,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 15:36:00,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 15:36:00,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 15:36:00,436 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 15:36:00,436 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 15:36:00,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 15:36:00,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 15:36:00,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:36:00,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 15:36:00,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 15:36:00,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 15:36:00,439 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-22 15:36:00,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 15:36:00,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 15:36:00,439 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 15:36:00,439 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-22 15:36:00,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 15:36:00,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 15:36:00,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 15:36:00,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 15:36:00,529 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 15:36:00,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-22 15:36:00,591 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f5c9f70be/3900755d97f5451dbd9e79f76bc54f94/FLAG9048a57c6 [2018-10-22 15:36:01,049 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 15:36:01,050 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-22 15:36:01,058 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f5c9f70be/3900755d97f5451dbd9e79f76bc54f94/FLAG9048a57c6 [2018-10-22 15:36:01,076 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/f5c9f70be/3900755d97f5451dbd9e79f76bc54f94 [2018-10-22 15:36:01,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 15:36:01,090 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-22 15:36:01,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:01,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 15:36:01,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 15:36:01,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128929bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01, skipping insertion in model container [2018-10-22 15:36:01,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 15:36:01,142 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 15:36:01,402 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:01,407 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 15:36:01,441 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 15:36:01,469 INFO L193 MainTranslator]: Completed translation [2018-10-22 15:36:01,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01 WrapperNode [2018-10-22 15:36:01,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 15:36:01,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:01,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 15:36:01,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 15:36:01,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 15:36:01,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 15:36:01,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 15:36:01,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 15:36:01,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... [2018-10-22 15:36:01,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 15:36:01,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 15:36:01,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 15:36:01,543 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 15:36:01,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 15:36:01,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-22 15:36:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 15:36:01,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 15:36:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-22 15:36:01,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-22 15:36:02,180 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 15:36:02,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:02 BoogieIcfgContainer [2018-10-22 15:36:02,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 15:36:02,182 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 15:36:02,182 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 15:36:02,186 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 15:36:02,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 03:36:01" (1/3) ... [2018-10-22 15:36:02,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c32f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:02, skipping insertion in model container [2018-10-22 15:36:02,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 03:36:01" (2/3) ... [2018-10-22 15:36:02,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c32f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 03:36:02, skipping insertion in model container [2018-10-22 15:36:02,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 03:36:02" (3/3) ... [2018-10-22 15:36:02,190 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-22 15:36:02,200 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 15:36:02,208 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 15:36:02,227 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 15:36:02,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 15:36:02,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 15:36:02,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 15:36:02,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 15:36:02,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 15:36:02,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 15:36:02,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 15:36:02,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 15:36:02,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 15:36:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-22 15:36:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-22 15:36:02,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:02,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:02,286 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:02,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash -44354441, now seen corresponding path program 1 times [2018-10-22 15:36:02,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:02,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:02,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:02,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-22 15:36:02,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-22 15:36:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-22 15:36:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:36:02,456 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-10-22 15:36:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:02,479 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-10-22 15:36:02,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-22 15:36:02,481 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-22 15:36:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:02,492 INFO L225 Difference]: With dead ends: 70 [2018-10-22 15:36:02,492 INFO L226 Difference]: Without dead ends: 30 [2018-10-22 15:36:02,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-22 15:36:02,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-22 15:36:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-22 15:36:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-22 15:36:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-22 15:36:02,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2018-10-22 15:36:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:02,538 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-22 15:36:02,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-22 15:36:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-22 15:36:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-22 15:36:02,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:02,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:02,540 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:02,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash 539359342, now seen corresponding path program 1 times [2018-10-22 15:36:02,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:02,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:02,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:02,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:02,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:02,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 15:36:02,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:36:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:36:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:02,881 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-10-22 15:36:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:03,108 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-10-22 15:36:03,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 15:36:03,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-10-22 15:36:03,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:03,112 INFO L225 Difference]: With dead ends: 60 [2018-10-22 15:36:03,112 INFO L226 Difference]: Without dead ends: 47 [2018-10-22 15:36:03,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:36:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-22 15:36:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-22 15:36:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-22 15:36:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-10-22 15:36:03,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2018-10-22 15:36:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:03,122 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-10-22 15:36:03,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:36:03,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-10-22 15:36:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-22 15:36:03,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:03,123 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:03,124 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:03,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:03,124 INFO L82 PathProgramCache]: Analyzing trace with hash -713539364, now seen corresponding path program 1 times [2018-10-22 15:36:03,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:03,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:03,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:03,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 15:36:03,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 15:36:03,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 15:36:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 15:36:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 15:36:03,208 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2018-10-22 15:36:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:03,658 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-10-22 15:36:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 15:36:03,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-22 15:36:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:03,661 INFO L225 Difference]: With dead ends: 88 [2018-10-22 15:36:03,663 INFO L226 Difference]: Without dead ends: 60 [2018-10-22 15:36:03,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:36:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-22 15:36:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-10-22 15:36:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-22 15:36:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-10-22 15:36:03,675 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-10-22 15:36:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:03,676 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-10-22 15:36:03,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 15:36:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-10-22 15:36:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-22 15:36:03,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:03,679 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:03,679 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash 199031775, now seen corresponding path program 1 times [2018-10-22 15:36:03,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:03,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:03,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:03,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:04,150 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-22 15:36:04,421 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2018-10-22 15:36:04,698 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2018-10-22 15:36:04,913 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-10-22 15:36:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:04,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:04,958 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:04,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:05,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:05,734 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-10-22 15:36:05,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:05,813 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:05,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:05,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:05,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:05,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:05,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-22 15:36:06,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:36:06,161 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:06,162 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:06,163 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:06,164 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:06,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-22 15:36:06,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:06,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:06,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:06,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-22 15:36:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:06,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:06,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-10-22 15:36:06,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-22 15:36:06,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-22 15:36:06,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-10-22 15:36:06,257 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-10-22 15:36:06,668 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-10-22 15:36:06,835 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-22 15:36:07,459 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-10-22 15:36:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:08,050 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2018-10-22 15:36:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-22 15:36:08,056 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-10-22 15:36:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:08,058 INFO L225 Difference]: With dead ends: 144 [2018-10-22 15:36:08,058 INFO L226 Difference]: Without dead ends: 113 [2018-10-22 15:36:08,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2018-10-22 15:36:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-22 15:36:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-10-22 15:36:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-22 15:36:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-10-22 15:36:08,070 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 24 [2018-10-22 15:36:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:08,070 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-10-22 15:36:08,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-22 15:36:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-10-22 15:36:08,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-22 15:36:08,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:08,072 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:08,073 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:08,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 739171567, now seen corresponding path program 1 times [2018-10-22 15:36:08,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:08,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:08,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:08,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:08,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:08,260 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:08,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:08,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:08,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:08,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-22 15:36:08,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-22 15:36:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-22 15:36:08,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:36:08,388 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 8 states. [2018-10-22 15:36:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:08,597 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-10-22 15:36:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-22 15:36:08,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-22 15:36:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:08,600 INFO L225 Difference]: With dead ends: 108 [2018-10-22 15:36:08,600 INFO L226 Difference]: Without dead ends: 87 [2018-10-22 15:36:08,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-22 15:36:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-10-22 15:36:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-22 15:36:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-10-22 15:36:08,612 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 32 [2018-10-22 15:36:08,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:08,612 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-10-22 15:36:08,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-22 15:36:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-10-22 15:36:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-22 15:36:08,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:08,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:08,614 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:08,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 20598919, now seen corresponding path program 1 times [2018-10-22 15:36:08,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:09,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:09,474 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:09,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:09,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:09,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:09,817 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:09,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:36:09,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:09,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:09,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:09,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:36:10,348 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:36:10,354 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:10,359 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-22 15:36:10,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:10,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:10,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:10,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-22 15:36:10,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:36:10,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:10,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:10,546 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:10,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 56 [2018-10-22 15:36:10,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:10,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:10,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:10,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:36:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:10,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:10,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2018-10-22 15:36:10,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:36:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:36:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:36:10,625 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 33 states. [2018-10-22 15:36:11,623 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2018-10-22 15:36:11,867 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2018-10-22 15:36:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:12,891 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2018-10-22 15:36:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-22 15:36:12,892 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-10-22 15:36:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:12,893 INFO L225 Difference]: With dead ends: 143 [2018-10-22 15:36:12,893 INFO L226 Difference]: Without dead ends: 78 [2018-10-22 15:36:12,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=334, Invalid=2018, Unknown=0, NotChecked=0, Total=2352 [2018-10-22 15:36:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-22 15:36:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 56. [2018-10-22 15:36:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-22 15:36:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-22 15:36:12,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 33 [2018-10-22 15:36:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:12,906 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-22 15:36:12,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:36:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-22 15:36:12,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-22 15:36:12,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:12,908 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:12,908 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:12,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -302162480, now seen corresponding path program 2 times [2018-10-22 15:36:12,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:12,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:12,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:13,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:13,583 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:13,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:13,609 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:13,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:13,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:13,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:13,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:13,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:13,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:13,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:13,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:13,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:36:14,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:36:14,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:14,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:14,042 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:14,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:36:14,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:14,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:14,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:14,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-10-22 15:36:14,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:14,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:14,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:14,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:14,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:14,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:14,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:14,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:14,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 21 [2018-10-22 15:36:14,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-22 15:36:14,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-22 15:36:14,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-22 15:36:14,281 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 21 states. [2018-10-22 15:36:15,623 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-10-22 15:36:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:15,775 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2018-10-22 15:36:15,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-22 15:36:15,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-10-22 15:36:15,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:15,778 INFO L225 Difference]: With dead ends: 196 [2018-10-22 15:36:15,779 INFO L226 Difference]: Without dead ends: 165 [2018-10-22 15:36:15,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=286, Invalid=1354, Unknown=0, NotChecked=0, Total=1640 [2018-10-22 15:36:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-22 15:36:15,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 88. [2018-10-22 15:36:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-22 15:36:15,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-10-22 15:36:15,792 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 36 [2018-10-22 15:36:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:15,792 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-10-22 15:36:15,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-22 15:36:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-10-22 15:36:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-22 15:36:15,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:15,794 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:15,794 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:15,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1890237920, now seen corresponding path program 2 times [2018-10-22 15:36:15,795 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:15,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:15,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:16,503 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:16,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:16,503 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:16,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:16,557 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:16,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:16,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:17,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:36:17,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:17,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:36:17,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-10-22 15:36:17,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:17,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:17,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:17,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:17,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:17,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2018-10-22 15:36:17,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:36:17,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:36:17,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:36:17,298 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 29 states. [2018-10-22 15:36:17,917 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-10-22 15:36:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:19,117 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2018-10-22 15:36:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-22 15:36:19,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2018-10-22 15:36:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:19,120 INFO L225 Difference]: With dead ends: 224 [2018-10-22 15:36:19,120 INFO L226 Difference]: Without dead ends: 193 [2018-10-22 15:36:19,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=277, Invalid=1703, Unknown=0, NotChecked=0, Total=1980 [2018-10-22 15:36:19,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-22 15:36:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 120. [2018-10-22 15:36:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-22 15:36:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-10-22 15:36:19,152 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 44 [2018-10-22 15:36:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:19,153 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-10-22 15:36:19,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:36:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-10-22 15:36:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-22 15:36:19,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:19,156 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:19,156 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:19,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1140389496, now seen corresponding path program 2 times [2018-10-22 15:36:19,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:19,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:20,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:20,320 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:20,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:20,347 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:20,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:20,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:20,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:20,636 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:20,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:36:20,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:49 [2018-10-22 15:36:20,866 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:36:20,870 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:20,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:36:20,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:20,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:36 [2018-10-22 15:36:20,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:36:20,981 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:20,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:36:20,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:21,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:21,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:21,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-10-22 15:36:21,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:36:21,087 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:21,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:36:21,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:21,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:21,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:21,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:36:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 31 [2018-10-22 15:36:21,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-22 15:36:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-22 15:36:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2018-10-22 15:36:21,157 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 31 states. [2018-10-22 15:36:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:23,117 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-10-22 15:36:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-22 15:36:23,124 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-22 15:36:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:23,125 INFO L225 Difference]: With dead ends: 209 [2018-10-22 15:36:23,125 INFO L226 Difference]: Without dead ends: 207 [2018-10-22 15:36:23,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=412, Invalid=2780, Unknown=0, NotChecked=0, Total=3192 [2018-10-22 15:36:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-22 15:36:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 97. [2018-10-22 15:36:23,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-22 15:36:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2018-10-22 15:36:23,139 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 45 [2018-10-22 15:36:23,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:23,139 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2018-10-22 15:36:23,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-22 15:36:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2018-10-22 15:36:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-22 15:36:23,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:23,141 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:23,141 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:23,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:23,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1343917494, now seen corresponding path program 3 times [2018-10-22 15:36:23,142 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:23,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:23,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:23,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:23,325 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:23,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:36:23,356 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-22 15:36:23,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:23,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:23,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:23,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-22 15:36:23,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-22 15:36:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-22 15:36:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-22 15:36:23,388 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand 7 states. [2018-10-22 15:36:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:23,616 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-10-22 15:36:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-22 15:36:23,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-10-22 15:36:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:23,619 INFO L225 Difference]: With dead ends: 187 [2018-10-22 15:36:23,620 INFO L226 Difference]: Without dead ends: 156 [2018-10-22 15:36:23,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:36:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-22 15:36:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 108. [2018-10-22 15:36:23,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-22 15:36:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-10-22 15:36:23,633 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 45 [2018-10-22 15:36:23,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:23,634 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-10-22 15:36:23,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-22 15:36:23,634 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-10-22 15:36:23,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-22 15:36:23,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:23,635 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:23,636 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:23,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:23,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1730116153, now seen corresponding path program 1 times [2018-10-22 15:36:23,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:23,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:24,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:24,400 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:24,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:24,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:24,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:24,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:24,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:24,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:24,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:24,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-22 15:36:24,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:36:24,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:24,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:24,934 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:24,935 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:24,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-22 15:36:24,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:24,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:24,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:24,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-22 15:36:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-10-22 15:36:25,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-22 15:36:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-22 15:36:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2018-10-22 15:36:25,030 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 28 states. [2018-10-22 15:36:25,460 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-10-22 15:36:26,174 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2018-10-22 15:36:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:27,211 INFO L93 Difference]: Finished difference Result 287 states and 319 transitions. [2018-10-22 15:36:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:36:27,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 47 [2018-10-22 15:36:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:27,213 INFO L225 Difference]: With dead ends: 287 [2018-10-22 15:36:27,213 INFO L226 Difference]: Without dead ends: 245 [2018-10-22 15:36:27,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=684, Invalid=2622, Unknown=0, NotChecked=0, Total=3306 [2018-10-22 15:36:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-22 15:36:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 121. [2018-10-22 15:36:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-22 15:36:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2018-10-22 15:36:27,230 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 47 [2018-10-22 15:36:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:27,231 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2018-10-22 15:36:27,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-22 15:36:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2018-10-22 15:36:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-22 15:36:27,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:27,232 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:27,233 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:27,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -465629712, now seen corresponding path program 3 times [2018-10-22 15:36:27,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:27,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:27,393 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:27,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:36:27,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-22 15:36:27,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:27,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:27,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:27,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-10-22 15:36:27,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 15:36:27,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 15:36:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-10-22 15:36:27,565 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand 11 states. [2018-10-22 15:36:27,927 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-22 15:36:28,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:28,139 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-10-22 15:36:28,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-22 15:36:28,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-10-22 15:36:28,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:28,140 INFO L225 Difference]: With dead ends: 244 [2018-10-22 15:36:28,140 INFO L226 Difference]: Without dead ends: 215 [2018-10-22 15:36:28,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-10-22 15:36:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-22 15:36:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 161. [2018-10-22 15:36:28,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-22 15:36:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2018-10-22 15:36:28,154 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 52 [2018-10-22 15:36:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:28,155 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2018-10-22 15:36:28,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 15:36:28,155 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-10-22 15:36:28,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-22 15:36:28,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:28,156 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:28,156 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:28,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:28,157 INFO L82 PathProgramCache]: Analyzing trace with hash -201170615, now seen corresponding path program 1 times [2018-10-22 15:36:28,157 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:28,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:28,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:28,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:28,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:28,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:28,941 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:28,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:28,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:29,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:29,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:36:29,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:29,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:29,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:29,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:36:29,420 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:36:29,458 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,474 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:29,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,544 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-10-22 15:36:29,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-10-22 15:36:29,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:29,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:29,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:29,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-22 15:36:29,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-22 15:36:29,826 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:29,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,873 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,889 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:29,910 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:29,910 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-10-22 15:36:29,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-22 15:36:29,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:30,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:30,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:30,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-22 15:36:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:30,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:30,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2018-10-22 15:36:30,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:36:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:36:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:36:30,257 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand 33 states. [2018-10-22 15:36:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:31,410 INFO L93 Difference]: Finished difference Result 207 states and 230 transitions. [2018-10-22 15:36:31,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-22 15:36:31,410 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 55 [2018-10-22 15:36:31,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:31,412 INFO L225 Difference]: With dead ends: 207 [2018-10-22 15:36:31,412 INFO L226 Difference]: Without dead ends: 190 [2018-10-22 15:36:31,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=231, Invalid=1749, Unknown=0, NotChecked=0, Total=1980 [2018-10-22 15:36:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-22 15:36:31,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 154. [2018-10-22 15:36:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-22 15:36:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-10-22 15:36:31,428 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 55 [2018-10-22 15:36:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:31,428 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-10-22 15:36:31,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:36:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-10-22 15:36:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-22 15:36:31,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:31,429 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:31,430 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:31,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash 934762349, now seen corresponding path program 4 times [2018-10-22 15:36:31,430 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:31,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:31,917 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-10-22 15:36:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:32,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:32,559 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:32,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:36:32,580 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:36:32,581 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:32,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:32,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:36:32,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:32,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:36:32,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:32,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:32,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:32,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-22 15:36:32,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:32,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:36:32,970 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:32,971 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:32,971 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:32,976 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:32,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:36:32,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:32,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:33,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:33,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-10-22 15:36:33,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:36:33,129 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:33,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:33,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:33,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:33,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:33,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-22 15:36:33,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:33,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:33,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:33,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:36:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-22 15:36:33,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:33,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2018-10-22 15:36:33,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-22 15:36:33,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-22 15:36:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2018-10-22 15:36:33,208 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 35 states. [2018-10-22 15:36:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:34,968 INFO L93 Difference]: Finished difference Result 366 states and 408 transitions. [2018-10-22 15:36:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-22 15:36:34,969 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 56 [2018-10-22 15:36:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:34,970 INFO L225 Difference]: With dead ends: 366 [2018-10-22 15:36:34,970 INFO L226 Difference]: Without dead ends: 269 [2018-10-22 15:36:34,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=614, Invalid=3292, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:36:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-22 15:36:34,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2018-10-22 15:36:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-22 15:36:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 178 transitions. [2018-10-22 15:36:34,992 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 178 transitions. Word has length 56 [2018-10-22 15:36:34,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:34,992 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 178 transitions. [2018-10-22 15:36:34,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-22 15:36:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 178 transitions. [2018-10-22 15:36:34,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-22 15:36:34,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:34,993 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:34,994 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:34,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:34,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1582841106, now seen corresponding path program 1 times [2018-10-22 15:36:34,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:34,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:34,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:35,368 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-22 15:36:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:36,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:36,270 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:36,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:36,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:36,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:36,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-10-22 15:36:36,540 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,542 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:36,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 60 [2018-10-22 15:36:36,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:36,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:38 [2018-10-22 15:36:36,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-22 15:36:36,625 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,626 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 43 [2018-10-22 15:36:36,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-22 15:36:36,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:36:36,713 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,716 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:36,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:36:36,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-10-22 15:36:36,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:36,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:36,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:36,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-22 15:36:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 29 [2018-10-22 15:36:36,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:36:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:36:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:36:36,919 INFO L87 Difference]: Start difference. First operand 163 states and 178 transitions. Second operand 29 states. [2018-10-22 15:36:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:38,330 INFO L93 Difference]: Finished difference Result 380 states and 419 transitions. [2018-10-22 15:36:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-22 15:36:38,337 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-22 15:36:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:38,339 INFO L225 Difference]: With dead ends: 380 [2018-10-22 15:36:38,339 INFO L226 Difference]: Without dead ends: 309 [2018-10-22 15:36:38,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=347, Invalid=1723, Unknown=0, NotChecked=0, Total=2070 [2018-10-22 15:36:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-22 15:36:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 200. [2018-10-22 15:36:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-22 15:36:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 220 transitions. [2018-10-22 15:36:38,365 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 220 transitions. Word has length 56 [2018-10-22 15:36:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:38,365 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 220 transitions. [2018-10-22 15:36:38,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:36:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 220 transitions. [2018-10-22 15:36:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-22 15:36:38,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:38,366 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:38,366 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:38,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash -741360303, now seen corresponding path program 4 times [2018-10-22 15:36:38,367 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:38,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:38,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:38,938 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 5 [2018-10-22 15:36:39,305 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 10 [2018-10-22 15:36:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:39,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:39,815 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:36:39,848 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:36:39,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:39,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:36:39,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:36:39,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:39,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:39,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:36:40,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:40,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:40,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:40,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:36:40,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:36:40,262 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:40,263 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:40,265 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:40,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:36:40,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-22 15:36:40,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:40,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:40,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:40,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:40,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:40,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-10-22 15:36:40,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-22 15:36:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-22 15:36:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1119, Unknown=0, NotChecked=0, Total=1260 [2018-10-22 15:36:40,536 INFO L87 Difference]: Start difference. First operand 200 states and 220 transitions. Second operand 36 states. [2018-10-22 15:36:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:41,718 INFO L93 Difference]: Finished difference Result 348 states and 385 transitions. [2018-10-22 15:36:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-22 15:36:41,718 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 56 [2018-10-22 15:36:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:41,719 INFO L225 Difference]: With dead ends: 348 [2018-10-22 15:36:41,719 INFO L226 Difference]: Without dead ends: 277 [2018-10-22 15:36:41,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=303, Invalid=2049, Unknown=0, NotChecked=0, Total=2352 [2018-10-22 15:36:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-22 15:36:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 222. [2018-10-22 15:36:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-22 15:36:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-22 15:36:41,746 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 56 [2018-10-22 15:36:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:41,746 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-22 15:36:41,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-22 15:36:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-22 15:36:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-22 15:36:41,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:41,748 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:41,748 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:41,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash -847043286, now seen corresponding path program 2 times [2018-10-22 15:36:41,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:41,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:41,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:41,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:41,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:42,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:42,532 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:42,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:36:42,562 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:36:42,562 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:36:42,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:42,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-22 15:36:42,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:42,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-10-22 15:36:42,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:42,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-10-22 15:36:43,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:36:43,093 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:43,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:43,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:43,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:36:43,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-10-22 15:36:43,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:36:43,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:36:43,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:43,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:36:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:43,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:43,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2018-10-22 15:36:43,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-22 15:36:43,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-22 15:36:43,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-10-22 15:36:43,248 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 29 states. [2018-10-22 15:36:45,855 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-22 15:36:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:47,637 INFO L93 Difference]: Finished difference Result 450 states and 494 transitions. [2018-10-22 15:36:47,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-22 15:36:47,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-10-22 15:36:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:47,639 INFO L225 Difference]: With dead ends: 450 [2018-10-22 15:36:47,639 INFO L226 Difference]: Without dead ends: 379 [2018-10-22 15:36:47,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=766, Invalid=3926, Unknown=0, NotChecked=0, Total=4692 [2018-10-22 15:36:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-22 15:36:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 222. [2018-10-22 15:36:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-22 15:36:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 244 transitions. [2018-10-22 15:36:47,668 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 244 transitions. Word has length 59 [2018-10-22 15:36:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:47,669 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 244 transitions. [2018-10-22 15:36:47,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-22 15:36:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 244 transitions. [2018-10-22 15:36:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:36:47,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:47,670 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:47,670 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:47,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:47,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1867762301, now seen corresponding path program 1 times [2018-10-22 15:36:47,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:47,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:47,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:47,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:36:47,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:48,193 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-10-22 15:36:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:50,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:50,001 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:50,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:50,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:50,452 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-22 15:36:50,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:36:50,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:50,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:36:50,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:50,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:50,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-22 15:36:51,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-10-22 15:36:51,912 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:51,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:51,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:51,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:51,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 97 [2018-10-22 15:36:51,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:51,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:51,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:51,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:51 [2018-10-22 15:36:52,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-22 15:36:52,374 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,376 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:52,377 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:52,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 115 [2018-10-22 15:36:52,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:52,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:52,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:36:52,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:44 [2018-10-22 15:36:52,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-10-22 15:36:52,767 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,769 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,771 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,774 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,778 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:52,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-10-22 15:36:52,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:36:52,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:36:52,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-22 15:36:52,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:77 [2018-10-22 15:36:53,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-22 15:36:53,288 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:53,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-22 15:36:53,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:53,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-10-22 15:36:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:53,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:53,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2018-10-22 15:36:53,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-22 15:36:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-22 15:36:53,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2840, Unknown=0, NotChecked=0, Total=3080 [2018-10-22 15:36:53,389 INFO L87 Difference]: Start difference. First operand 222 states and 244 transitions. Second operand 56 states. [2018-10-22 15:36:54,318 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 11 [2018-10-22 15:36:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:57,043 INFO L93 Difference]: Finished difference Result 303 states and 330 transitions. [2018-10-22 15:36:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-22 15:36:57,043 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 64 [2018-10-22 15:36:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:57,044 INFO L225 Difference]: With dead ends: 303 [2018-10-22 15:36:57,044 INFO L226 Difference]: Without dead ends: 286 [2018-10-22 15:36:57,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2618 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=718, Invalid=6764, Unknown=0, NotChecked=0, Total=7482 [2018-10-22 15:36:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-22 15:36:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 246. [2018-10-22 15:36:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-22 15:36:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 269 transitions. [2018-10-22 15:36:57,077 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 269 transitions. Word has length 64 [2018-10-22 15:36:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:57,078 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 269 transitions. [2018-10-22 15:36:57,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-22 15:36:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 269 transitions. [2018-10-22 15:36:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:36:57,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:36:57,079 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:36:57,079 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:36:57,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:36:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash 975512830, now seen corresponding path program 1 times [2018-10-22 15:36:57,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:36:57,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:36:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:57,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:57,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:36:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:36:57,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:36:57,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:36:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:36:58,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:36:58,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-22 15:36:58,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:58,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-22 15:36:58,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-22 15:36:58,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-10-22 15:36:58,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:58,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:36:58,245 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:36:58,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-22 15:36:58,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:36:58,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-22 15:36:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:36:58,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:36:58,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 24 [2018-10-22 15:36:58,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-22 15:36:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-22 15:36:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2018-10-22 15:36:58,299 INFO L87 Difference]: Start difference. First operand 246 states and 269 transitions. Second operand 24 states. [2018-10-22 15:36:59,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:36:59,951 INFO L93 Difference]: Finished difference Result 671 states and 740 transitions. [2018-10-22 15:36:59,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-22 15:36:59,951 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 64 [2018-10-22 15:36:59,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:36:59,954 INFO L225 Difference]: With dead ends: 671 [2018-10-22 15:36:59,954 INFO L226 Difference]: Without dead ends: 579 [2018-10-22 15:36:59,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=529, Invalid=3503, Unknown=0, NotChecked=0, Total=4032 [2018-10-22 15:36:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-22 15:36:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 309. [2018-10-22 15:36:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-22 15:36:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 341 transitions. [2018-10-22 15:36:59,998 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 341 transitions. Word has length 64 [2018-10-22 15:36:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:36:59,999 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 341 transitions. [2018-10-22 15:36:59,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-22 15:36:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 341 transitions. [2018-10-22 15:37:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-22 15:37:00,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:00,000 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:00,000 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:00,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2144727967, now seen corresponding path program 5 times [2018-10-22 15:37:00,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:00,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:00,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:00,514 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:37:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:01,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:01,057 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:01,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:37:01,101 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-22 15:37:01,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:01,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:01,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:37:01,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:37:01,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:01,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:01,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:01,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-10-22 15:37:01,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:01,947 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:01,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:01,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:01,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:01,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:01,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-22 15:37:02,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-22 15:37:02,287 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:02,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:02,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:02,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-10-22 15:37:02,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:02,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:02,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:02,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-22 15:37:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:02,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:02,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-10-22 15:37:02,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-22 15:37:02,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-22 15:37:02,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1215, Unknown=0, NotChecked=0, Total=1332 [2018-10-22 15:37:02,378 INFO L87 Difference]: Start difference. First operand 309 states and 341 transitions. Second operand 37 states. [2018-10-22 15:37:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:04,849 INFO L93 Difference]: Finished difference Result 491 states and 538 transitions. [2018-10-22 15:37:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-22 15:37:04,849 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 64 [2018-10-22 15:37:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:04,851 INFO L225 Difference]: With dead ends: 491 [2018-10-22 15:37:04,851 INFO L226 Difference]: Without dead ends: 489 [2018-10-22 15:37:04,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=408, Invalid=3498, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:37:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-22 15:37:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 350. [2018-10-22 15:37:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-22 15:37:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 387 transitions. [2018-10-22 15:37:04,905 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 387 transitions. Word has length 64 [2018-10-22 15:37:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:04,905 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 387 transitions. [2018-10-22 15:37:04,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-22 15:37:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 387 transitions. [2018-10-22 15:37:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 15:37:04,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:04,907 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:04,907 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:04,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1112045462, now seen corresponding path program 1 times [2018-10-22 15:37:04,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:04,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:05,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:05,974 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:05,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:06,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:06,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:06,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:06,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:37:06,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:37:06,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:06,475 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-10-22 15:37:06,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:06,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-10-22 15:37:06,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:37:06,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,680 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,681 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 87 [2018-10-22 15:37:06,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:06,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-10-22 15:37:06,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-10-22 15:37:06,832 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,833 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:06,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 96 [2018-10-22 15:37:06,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:06,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:06,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:29 [2018-10-22 15:37:06,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-22 15:37:06,991 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:07,014 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:07,036 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:07,049 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:07,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:07,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-10-22 15:37:07,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:07,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:07,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:07,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-10-22 15:37:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 69 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-22 15:37:07,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:07,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 43 [2018-10-22 15:37:07,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 15:37:07,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 15:37:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:37:07,183 INFO L87 Difference]: Start difference. First operand 350 states and 387 transitions. Second operand 43 states. [2018-10-22 15:37:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:10,137 INFO L93 Difference]: Finished difference Result 603 states and 667 transitions. [2018-10-22 15:37:10,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:37:10,137 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 65 [2018-10-22 15:37:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:10,139 INFO L225 Difference]: With dead ends: 603 [2018-10-22 15:37:10,139 INFO L226 Difference]: Without dead ends: 511 [2018-10-22 15:37:10,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=625, Invalid=4925, Unknown=0, NotChecked=0, Total=5550 [2018-10-22 15:37:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-22 15:37:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 321. [2018-10-22 15:37:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-22 15:37:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 354 transitions. [2018-10-22 15:37:10,184 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 354 transitions. Word has length 65 [2018-10-22 15:37:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:10,184 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 354 transitions. [2018-10-22 15:37:10,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 15:37:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 354 transitions. [2018-10-22 15:37:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 15:37:10,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:10,185 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:10,185 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:10,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:10,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1242756520, now seen corresponding path program 2 times [2018-10-22 15:37:10,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:10,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:10,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-22 15:37:10,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:10,541 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:10,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:10,601 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:10,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:10,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-22 15:37:10,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-22 15:37:10,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 15:37:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 15:37:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-22 15:37:10,639 INFO L87 Difference]: Start difference. First operand 321 states and 354 transitions. Second operand 6 states. [2018-10-22 15:37:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:10,842 INFO L93 Difference]: Finished difference Result 488 states and 538 transitions. [2018-10-22 15:37:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-22 15:37:10,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-22 15:37:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:10,845 INFO L225 Difference]: With dead ends: 488 [2018-10-22 15:37:10,846 INFO L226 Difference]: Without dead ends: 396 [2018-10-22 15:37:10,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-22 15:37:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-22 15:37:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 306. [2018-10-22 15:37:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-22 15:37:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 335 transitions. [2018-10-22 15:37:10,886 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 335 transitions. Word has length 65 [2018-10-22 15:37:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:10,887 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 335 transitions. [2018-10-22 15:37:10,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 15:37:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 335 transitions. [2018-10-22 15:37:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-22 15:37:10,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:10,888 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:10,888 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:10,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:10,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1300794170, now seen corresponding path program 2 times [2018-10-22 15:37:10,889 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:10,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:10,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:10,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:11,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:11,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:11,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:11,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:11,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:12,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:12,041 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:12,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:37:12,344 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:37:12,361 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,361 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:12,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:37:12,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-22 15:37:12,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-22 15:37:12,517 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,518 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,521 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-10-22 15:37:12,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-22 15:37:12,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:37:12,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:12,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:37:12,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:12,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:37:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:12,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-10-22 15:37:12,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-22 15:37:12,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-22 15:37:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1700, Unknown=0, NotChecked=0, Total=1892 [2018-10-22 15:37:12,875 INFO L87 Difference]: Start difference. First operand 306 states and 335 transitions. Second operand 44 states. [2018-10-22 15:37:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:14,537 INFO L93 Difference]: Finished difference Result 386 states and 419 transitions. [2018-10-22 15:37:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-22 15:37:14,538 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 67 [2018-10-22 15:37:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:14,540 INFO L225 Difference]: With dead ends: 386 [2018-10-22 15:37:14,541 INFO L226 Difference]: Without dead ends: 384 [2018-10-22 15:37:14,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1202 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=401, Invalid=3505, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:37:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-22 15:37:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2018-10-22 15:37:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-22 15:37:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 328 transitions. [2018-10-22 15:37:14,591 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 328 transitions. Word has length 67 [2018-10-22 15:37:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:14,591 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 328 transitions. [2018-10-22 15:37:14,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-22 15:37:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 328 transitions. [2018-10-22 15:37:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-22 15:37:14,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:14,593 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:14,593 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:14,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:14,593 INFO L82 PathProgramCache]: Analyzing trace with hash 47502430, now seen corresponding path program 5 times [2018-10-22 15:37:14,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:14,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:14,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:14,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:14,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:15,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:15,553 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:15,561 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-22 15:37:15,592 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-22 15:37:15,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:15,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:15,805 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:15,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:15,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:37:15,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:15,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:15,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:15,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-22 15:37:15,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:15,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-22 15:37:15,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:15,918 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:15,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-22 15:37:15,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:15,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:15,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:15,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:38 [2018-10-22 15:37:16,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-10-22 15:37:16,006 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,008 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,009 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-10-22 15:37:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-10-22 15:37:16,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:37:16,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:16,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:37:16,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:16,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:37:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 15:37:16,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:16,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 33 [2018-10-22 15:37:16,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-22 15:37:16,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-22 15:37:16,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-10-22 15:37:16,155 INFO L87 Difference]: Start difference. First operand 299 states and 328 transitions. Second operand 33 states. [2018-10-22 15:37:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:19,312 INFO L93 Difference]: Finished difference Result 521 states and 567 transitions. [2018-10-22 15:37:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-22 15:37:19,313 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 68 [2018-10-22 15:37:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:19,314 INFO L225 Difference]: With dead ends: 521 [2018-10-22 15:37:19,314 INFO L226 Difference]: Without dead ends: 445 [2018-10-22 15:37:19,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=994, Invalid=4706, Unknown=0, NotChecked=0, Total=5700 [2018-10-22 15:37:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-22 15:37:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 267. [2018-10-22 15:37:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-22 15:37:19,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 289 transitions. [2018-10-22 15:37:19,352 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 289 transitions. Word has length 68 [2018-10-22 15:37:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:19,353 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 289 transitions. [2018-10-22 15:37:19,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-22 15:37:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 289 transitions. [2018-10-22 15:37:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 15:37:19,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:19,354 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:19,354 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:19,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2087155470, now seen corresponding path program 2 times [2018-10-22 15:37:19,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:19,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:19,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:19,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:19,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:19,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:19,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:19,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:19,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:19,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:19,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-22 15:37:19,979 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:19,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-10-22 15:37:19,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:19,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:19,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:19,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-10-22 15:37:20,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-10-22 15:37:20,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:20,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:20,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-10-22 15:37:20,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:20,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:20,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:20,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:3 [2018-10-22 15:37:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:20,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:20,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-10-22 15:37:20,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-22 15:37:20,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-22 15:37:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2018-10-22 15:37:20,314 INFO L87 Difference]: Start difference. First operand 267 states and 289 transitions. Second operand 31 states. [2018-10-22 15:37:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:21,877 INFO L93 Difference]: Finished difference Result 408 states and 434 transitions. [2018-10-22 15:37:21,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-22 15:37:21,878 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2018-10-22 15:37:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:21,879 INFO L225 Difference]: With dead ends: 408 [2018-10-22 15:37:21,879 INFO L226 Difference]: Without dead ends: 406 [2018-10-22 15:37:21,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=328, Invalid=2324, Unknown=0, NotChecked=0, Total=2652 [2018-10-22 15:37:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-22 15:37:21,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 263. [2018-10-22 15:37:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-22 15:37:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 284 transitions. [2018-10-22 15:37:21,916 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 284 transitions. Word has length 72 [2018-10-22 15:37:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:21,916 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 284 transitions. [2018-10-22 15:37:21,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-22 15:37:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 284 transitions. [2018-10-22 15:37:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-22 15:37:21,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:21,917 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:21,917 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:21,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:21,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1794356367, now seen corresponding path program 6 times [2018-10-22 15:37:21,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:21,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:21,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:21,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:22,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:22,728 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:22,736 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-22 15:37:22,772 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-22 15:37:22,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:22,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:22,875 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:22,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:22,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-22 15:37:22,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-22 15:37:22,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-22 15:37:22,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-22 15:37:22,895 INFO L87 Difference]: Start difference. First operand 263 states and 284 transitions. Second operand 14 states. [2018-10-22 15:37:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:23,342 INFO L93 Difference]: Finished difference Result 391 states and 418 transitions. [2018-10-22 15:37:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-22 15:37:23,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-10-22 15:37:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:23,343 INFO L225 Difference]: With dead ends: 391 [2018-10-22 15:37:23,343 INFO L226 Difference]: Without dead ends: 354 [2018-10-22 15:37:23,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-10-22 15:37:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-22 15:37:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 277. [2018-10-22 15:37:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-22 15:37:23,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 298 transitions. [2018-10-22 15:37:23,379 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 298 transitions. Word has length 72 [2018-10-22 15:37:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:23,380 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 298 transitions. [2018-10-22 15:37:23,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-22 15:37:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 298 transitions. [2018-10-22 15:37:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-22 15:37:23,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:23,380 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:23,381 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:23,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:23,381 INFO L82 PathProgramCache]: Analyzing trace with hash -622242011, now seen corresponding path program 2 times [2018-10-22 15:37:23,381 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:23,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:23,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:23,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:24,203 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-10-22 15:37:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 11 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:26,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:26,155 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:26,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 15:37:26,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 15:37:26,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:26,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:26,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:26,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:26,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 61 [2018-10-22 15:37:26,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:48 [2018-10-22 15:37:26,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-10-22 15:37:26,691 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:26,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 71 [2018-10-22 15:37:26,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-10-22 15:37:26,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-22 15:37:26,838 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:26,839 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,841 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,846 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:26,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 106 [2018-10-22 15:37:26,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:26,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:47 [2018-10-22 15:37:27,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-10-22 15:37:27,266 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,267 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,269 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,274 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:27,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,276 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:27,279 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,286 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 191 [2018-10-22 15:37:27,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:37:27,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:27,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:27,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:56 [2018-10-22 15:37:27,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-10-22 15:37:27,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,667 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,670 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,671 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,673 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,675 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:27,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 161 [2018-10-22 15:37:27,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-22 15:37:27,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:37:27,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-22 15:37:27,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:75, output treesize:89 [2018-10-22 15:37:28,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-10-22 15:37:28,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:28,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-22 15:37:28,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:28,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:28,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:28,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-22 15:37:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:28,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:28,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 57 [2018-10-22 15:37:28,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-22 15:37:28,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-22 15:37:28,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=2840, Unknown=0, NotChecked=0, Total=3192 [2018-10-22 15:37:28,109 INFO L87 Difference]: Start difference. First operand 277 states and 298 transitions. Second operand 57 states. [2018-10-22 15:37:28,789 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-10-22 15:37:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:32,094 INFO L93 Difference]: Finished difference Result 342 states and 365 transitions. [2018-10-22 15:37:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-22 15:37:32,094 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 73 [2018-10-22 15:37:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:32,096 INFO L225 Difference]: With dead ends: 342 [2018-10-22 15:37:32,097 INFO L226 Difference]: Without dead ends: 325 [2018-10-22 15:37:32,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 44 SyntacticMatches, 17 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=931, Invalid=7811, Unknown=0, NotChecked=0, Total=8742 [2018-10-22 15:37:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-22 15:37:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 241. [2018-10-22 15:37:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-22 15:37:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 259 transitions. [2018-10-22 15:37:32,139 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 259 transitions. Word has length 73 [2018-10-22 15:37:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:32,140 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 259 transitions. [2018-10-22 15:37:32,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-22 15:37:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 259 transitions. [2018-10-22 15:37:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-22 15:37:32,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:32,141 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:32,141 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1163723925, now seen corresponding path program 1 times [2018-10-22 15:37:32,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:32,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:32,495 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2018-10-22 15:37:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:32,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:32,996 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:33,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:33,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:33,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:37:33,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:37:33,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:37 [2018-10-22 15:37:33,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-10-22 15:37:33,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,403 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-22 15:37:33,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:33,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-22 15:37:33,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-10-22 15:37:33,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:33,586 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,590 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:33,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:33,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2018-10-22 15:37:33,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:33,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:5 [2018-10-22 15:37:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:33,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:33,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 35 [2018-10-22 15:37:33,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-22 15:37:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-22 15:37:33,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-10-22 15:37:33,673 INFO L87 Difference]: Start difference. First operand 241 states and 259 transitions. Second operand 35 states. [2018-10-22 15:37:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:37,892 INFO L93 Difference]: Finished difference Result 356 states and 378 transitions. [2018-10-22 15:37:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-22 15:37:37,892 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 75 [2018-10-22 15:37:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:37,893 INFO L225 Difference]: With dead ends: 356 [2018-10-22 15:37:37,894 INFO L226 Difference]: Without dead ends: 354 [2018-10-22 15:37:37,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1035, Invalid=10307, Unknown=0, NotChecked=0, Total=11342 [2018-10-22 15:37:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-22 15:37:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 254. [2018-10-22 15:37:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-22 15:37:37,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 273 transitions. [2018-10-22 15:37:37,951 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 273 transitions. Word has length 75 [2018-10-22 15:37:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:37,951 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 273 transitions. [2018-10-22 15:37:37,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-22 15:37:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 273 transitions. [2018-10-22 15:37:37,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 15:37:37,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:37,952 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:37,952 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:37,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:37,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2019441042, now seen corresponding path program 3 times [2018-10-22 15:37:37,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:37,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:38,497 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-10-22 15:37:38,762 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2018-10-22 15:37:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:40,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:40,741 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:40,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:37:40,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-22 15:37:40,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:40,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:40,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:40,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:40,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:40,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:40,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:40,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:40,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-10-22 15:37:40,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-10-22 15:37:40,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:40,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:40,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:40,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 70 [2018-10-22 15:37:40,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:41,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:41,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:41,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:46 [2018-10-22 15:37:41,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-10-22 15:37:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,306 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,308 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,310 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,313 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 148 [2018-10-22 15:37:41,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-22 15:37:41,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:37:41,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-22 15:37:41,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:116 [2018-10-22 15:37:41,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-10-22 15:37:41,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,952 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,953 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,955 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:41,955 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:41,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 101 [2018-10-22 15:37:41,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:41,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:41,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:42,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:38 [2018-10-22 15:37:42,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-22 15:37:42,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:42,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:42,081 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:42,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-10-22 15:37:42,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-10-22 15:37:42,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:42,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:42,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:42,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 48 [2018-10-22 15:37:42,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-22 15:37:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-22 15:37:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2018-10-22 15:37:42,378 INFO L87 Difference]: Start difference. First operand 254 states and 273 transitions. Second operand 48 states. [2018-10-22 15:37:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:46,401 INFO L93 Difference]: Finished difference Result 369 states and 395 transitions. [2018-10-22 15:37:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-22 15:37:46,401 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 76 [2018-10-22 15:37:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:46,402 INFO L225 Difference]: With dead ends: 369 [2018-10-22 15:37:46,402 INFO L226 Difference]: Without dead ends: 352 [2018-10-22 15:37:46,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 24 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=623, Invalid=6019, Unknown=0, NotChecked=0, Total=6642 [2018-10-22 15:37:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-22 15:37:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 286. [2018-10-22 15:37:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-22 15:37:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 307 transitions. [2018-10-22 15:37:46,452 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 307 transitions. Word has length 76 [2018-10-22 15:37:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:46,453 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 307 transitions. [2018-10-22 15:37:46,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-22 15:37:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 307 transitions. [2018-10-22 15:37:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 15:37:46,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:46,453 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:46,454 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:46,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash -515741841, now seen corresponding path program 3 times [2018-10-22 15:37:46,454 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:46,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:46,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:46,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:47,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:47,397 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:47,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:37:47,443 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-22 15:37:47,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:47,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:47,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:47,763 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:47,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:47,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:47,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-10-22 15:37:47,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-10-22 15:37:47,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:47,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:47,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:47,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-10-22 15:37:47,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:47,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-22 15:37:47,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:30 [2018-10-22 15:37:48,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-10-22 15:37:48,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:48,157 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:48,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:48,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-10-22 15:37:48,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:48,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-22 15:37:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 6 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:48,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:48,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2018-10-22 15:37:48,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-22 15:37:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-22 15:37:48,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-10-22 15:37:48,246 INFO L87 Difference]: Start difference. First operand 286 states and 307 transitions. Second operand 37 states. [2018-10-22 15:37:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:51,024 INFO L93 Difference]: Finished difference Result 434 states and 463 transitions. [2018-10-22 15:37:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-22 15:37:51,024 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2018-10-22 15:37:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:51,026 INFO L225 Difference]: With dead ends: 434 [2018-10-22 15:37:51,026 INFO L226 Difference]: Without dead ends: 432 [2018-10-22 15:37:51,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=501, Invalid=3405, Unknown=0, NotChecked=0, Total=3906 [2018-10-22 15:37:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-22 15:37:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 310. [2018-10-22 15:37:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-22 15:37:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 334 transitions. [2018-10-22 15:37:51,083 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 334 transitions. Word has length 76 [2018-10-22 15:37:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:51,083 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 334 transitions. [2018-10-22 15:37:51,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-22 15:37:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 334 transitions. [2018-10-22 15:37:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 15:37:51,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:51,084 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:51,084 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:51,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1889992209, now seen corresponding path program 4 times [2018-10-22 15:37:51,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:51,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:51,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:51,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:51,557 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 5 [2018-10-22 15:37:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:52,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:52,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:52,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-22 15:37:52,254 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-22 15:37:52,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:37:52,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:52,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:37:52,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:37:52,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:37:52,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-22 15:37:52,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-10-22 15:37:52,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-22 15:37:52,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:37:52,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,686 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,688 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:37:52,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-10-22 15:37:52,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-10-22 15:37:52,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:52,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-10-22 15:37:52,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:52,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-10-22 15:37:53,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-10-22 15:37:53,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-22 15:37:53,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:53,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-22 15:37:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:53,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:53,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2018-10-22 15:37:53,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-22 15:37:53,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-22 15:37:53,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1634, Unknown=0, NotChecked=0, Total=1806 [2018-10-22 15:37:53,130 INFO L87 Difference]: Start difference. First operand 310 states and 334 transitions. Second operand 43 states. [2018-10-22 15:37:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:56,235 INFO L93 Difference]: Finished difference Result 611 states and 658 transitions. [2018-10-22 15:37:56,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-22 15:37:56,235 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 76 [2018-10-22 15:37:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:56,237 INFO L225 Difference]: With dead ends: 611 [2018-10-22 15:37:56,237 INFO L226 Difference]: Without dead ends: 554 [2018-10-22 15:37:56,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2612 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=935, Invalid=7075, Unknown=0, NotChecked=0, Total=8010 [2018-10-22 15:37:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-22 15:37:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 318. [2018-10-22 15:37:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-22 15:37:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 343 transitions. [2018-10-22 15:37:56,296 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 343 transitions. Word has length 76 [2018-10-22 15:37:56,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:56,296 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 343 transitions. [2018-10-22 15:37:56,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-22 15:37:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 343 transitions. [2018-10-22 15:37:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-22 15:37:56,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:56,297 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:56,297 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:56,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -715265710, now seen corresponding path program 7 times [2018-10-22 15:37:56,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:56,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:56,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:37:56,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:56,779 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-22 15:37:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:57,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:37:57,262 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:37:57,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:37:57,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:37:57,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-22 15:37:57,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-22 15:37:57,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-22 15:37:57,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-10-22 15:37:57,413 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-10-22 15:37:57,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-10-22 15:37:57,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-10-22 15:37:57,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-10-22 15:37:57,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:19 [2018-10-22 15:37:57,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-22 15:37:57,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,627 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:57,629 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:37:57,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:37:57,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 50 [2018-10-22 15:37:57,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:37:57,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-22 15:37:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:37:57,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:37:57,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2018-10-22 15:37:57,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-22 15:37:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-22 15:37:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2018-10-22 15:37:57,704 INFO L87 Difference]: Start difference. First operand 318 states and 343 transitions. Second operand 27 states. [2018-10-22 15:37:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:37:59,401 INFO L93 Difference]: Finished difference Result 449 states and 480 transitions. [2018-10-22 15:37:59,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-22 15:37:59,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-10-22 15:37:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:37:59,403 INFO L225 Difference]: With dead ends: 449 [2018-10-22 15:37:59,404 INFO L226 Difference]: Without dead ends: 447 [2018-10-22 15:37:59,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2018-10-22 15:37:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-22 15:37:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 366. [2018-10-22 15:37:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-22 15:37:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 396 transitions. [2018-10-22 15:37:59,493 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 396 transitions. Word has length 76 [2018-10-22 15:37:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:37:59,494 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 396 transitions. [2018-10-22 15:37:59,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-22 15:37:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 396 transitions. [2018-10-22 15:37:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-22 15:37:59,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:37:59,495 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:37:59,495 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:37:59,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:37:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash 326259627, now seen corresponding path program 3 times [2018-10-22 15:37:59,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:37:59,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:37:59,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:59,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 15:37:59,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:37:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 15:38:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:00,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 15:38:00,914 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 15:38:00,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-22 15:38:00,964 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-22 15:38:00,964 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 15:38:00,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 15:38:01,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-10-22 15:38:01,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 50 [2018-10-22 15:38:01,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-10-22 15:38:01,496 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-22 15:38:01,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:01,507 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2018-10-22 15:38:01,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-22 15:38:01,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:40 [2018-10-22 15:38:01,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-22 15:38:01,784 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,785 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 89 [2018-10-22 15:38:01,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:36 [2018-10-22 15:38:01,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-10-22 15:38:01,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,857 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:01,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 92 [2018-10-22 15:38:01,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:01,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:21 [2018-10-22 15:38:02,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-10-22 15:38:02,065 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:02,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:02,066 INFO L682 Elim1Store]: detected equality via solver [2018-10-22 15:38:02,067 INFO L700 Elim1Store]: detected not equals via solver [2018-10-22 15:38:02,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2018-10-22 15:38:02,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-22 15:38:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:02,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-22 15:38:02,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-10-22 15:38:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 52 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 15:38:02,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-22 15:38:02,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 47 [2018-10-22 15:38:02,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-22 15:38:02,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-22 15:38:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1950, Unknown=0, NotChecked=0, Total=2162 [2018-10-22 15:38:02,156 INFO L87 Difference]: Start difference. First operand 366 states and 396 transitions. Second operand 47 states. [2018-10-22 15:38:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 15:38:10,385 INFO L93 Difference]: Finished difference Result 707 states and 762 transitions. [2018-10-22 15:38:10,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-22 15:38:10,385 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 79 [2018-10-22 15:38:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 15:38:10,387 INFO L225 Difference]: With dead ends: 707 [2018-10-22 15:38:10,387 INFO L226 Difference]: Without dead ends: 650 [2018-10-22 15:38:10,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9728 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2018, Invalid=23742, Unknown=0, NotChecked=0, Total=25760 [2018-10-22 15:38:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-22 15:38:10,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 372. [2018-10-22 15:38:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-22 15:38:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 403 transitions. [2018-10-22 15:38:10,476 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 403 transitions. Word has length 79 [2018-10-22 15:38:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 15:38:10,476 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 403 transitions. [2018-10-22 15:38:10,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-22 15:38:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 403 transitions. [2018-10-22 15:38:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-22 15:38:10,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 15:38:10,477 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 15:38:10,477 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 15:38:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 15:38:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2049798021, now seen corresponding path program 2 times [2018-10-22 15:38:10,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-22 15:38:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-22 15:38:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:10,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-22 15:38:10,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 15:38:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-22 15:38:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-22 15:38:10,538 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-22 15:38:10,554 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,555 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,556 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,556 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,556 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,556 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,557 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,557 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,557 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,560 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,564 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,565 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,566 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,567 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,567 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,567 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,567 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,568 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,569 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,570 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,571 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,572 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,573 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,574 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,575 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,576 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,577 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,578 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,579 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,580 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,581 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,582 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,583 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,584 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,584 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,584 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,584 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,585 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,585 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,585 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,585 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,585 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,586 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,586 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,586 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,586 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,586 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,587 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,587 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,587 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,587 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,587 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,588 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,589 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,590 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,591 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,592 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-22 15:38:10,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 03:38:10 BoogieIcfgContainer [2018-10-22 15:38:10,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 15:38:10,628 INFO L168 Benchmark]: Toolchain (without parser) took 129539.06 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -656.5 MB). Peak memory consumption was 400.5 MB. Max. memory is 7.1 GB. [2018-10-22 15:38:10,629 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:38:10,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-22 15:38:10,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:38:10,629 INFO L168 Benchmark]: Boogie Preprocessor took 29.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-22 15:38:10,629 INFO L168 Benchmark]: RCFGBuilder took 638.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2018-10-22 15:38:10,630 INFO L168 Benchmark]: TraceAbstraction took 128444.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 320.3 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 101.9 MB). Peak memory consumption was 422.2 MB. Max. memory is 7.1 GB. [2018-10-22 15:38:10,632 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.47 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 638.55 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 128444.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 320.3 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 101.9 MB). Peak memory consumption was 422.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] CALL int v[SIZE]; [L13] RET int v[SIZE]; [L14] j=1 [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR, FCALL v[i] [L19] FCALL v[i+1] = v[i] [L20] i = i - 1 [L17] (i>=0) && (v[i]>key) [L17] EXPR, FCALL v[i] [L17] (i>=0) && (v[i]>key) [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] FCALL v[i+1] = key [L14] j++ [L14] COND FALSE !(j