./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/recHanoi02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive/recHanoi02_true-unreach-call_true-no-overflow_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f48e7b9931723f1165b5bb8f3d86571b9aa1aa14 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 22:05:29,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 22:05:29,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 22:05:29,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 22:05:29,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 22:05:29,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 22:05:29,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 22:05:29,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 22:05:29,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 22:05:29,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 22:05:29,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 22:05:29,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 22:05:29,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 22:05:29,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 22:05:29,603 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 22:05:29,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 22:05:29,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 22:05:29,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 22:05:29,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 22:05:29,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 22:05:29,619 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 22:05:29,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 22:05:29,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 22:05:29,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 22:05:29,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 22:05:29,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 22:05:29,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 22:05:29,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 22:05:29,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 22:05:29,636 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 22:05:29,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 22:05:29,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 22:05:29,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 22:05:29,639 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 22:05:29,640 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 22:05:29,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 22:05:29,642 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 22:05:29,670 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 22:05:29,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 22:05:29,672 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 22:05:29,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 22:05:29,673 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 22:05:29,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 22:05:29,674 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 22:05:29,675 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 22:05:29,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 22:05:29,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 22:05:29,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 22:05:29,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 22:05:29,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 22:05:29,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 22:05:29,676 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 22:05:29,676 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 22:05:29,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 22:05:29,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 22:05:29,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 22:05:29,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 22:05:29,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 22:05:29,678 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 22:05:29,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 22:05:29,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 22:05:29,679 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 22:05:29,679 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 22:05:29,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 22:05:29,680 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 22:05:29,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 22:05:29,680 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f48e7b9931723f1165b5bb8f3d86571b9aa1aa14 [2019-01-14 22:05:29,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 22:05:29,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 22:05:29,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 22:05:29,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 22:05:29,754 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 22:05:29,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/recHanoi02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 22:05:29,809 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ef393e/9d2604de240c43ba9bcb70d8729c7f11/FLAG8758936b0 [2019-01-14 22:05:30,256 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 22:05:30,257 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/recHanoi02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 22:05:30,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ef393e/9d2604de240c43ba9bcb70d8729c7f11/FLAG8758936b0 [2019-01-14 22:05:30,641 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8ef393e/9d2604de240c43ba9bcb70d8729c7f11 [2019-01-14 22:05:30,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 22:05:30,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 22:05:30,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 22:05:30,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 22:05:30,651 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 22:05:30,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3240233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30, skipping insertion in model container [2019-01-14 22:05:30,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 22:05:30,681 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 22:05:30,871 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 22:05:30,877 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 22:05:30,899 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 22:05:30,918 INFO L195 MainTranslator]: Completed translation [2019-01-14 22:05:30,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30 WrapperNode [2019-01-14 22:05:30,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 22:05:30,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 22:05:30,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 22:05:30,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 22:05:30,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 22:05:30,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 22:05:30,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 22:05:30,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 22:05:30,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... [2019-01-14 22:05:30,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 22:05:30,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 22:05:30,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 22:05:30,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 22:05:30,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-14 22:05:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-14 22:05:31,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 22:05:31,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 22:05:31,291 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 22:05:31,291 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 22:05:31,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:05:31 BoogieIcfgContainer [2019-01-14 22:05:31,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 22:05:31,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 22:05:31,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 22:05:31,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 22:05:31,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 10:05:30" (1/3) ... [2019-01-14 22:05:31,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3eda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 10:05:31, skipping insertion in model container [2019-01-14 22:05:31,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 10:05:30" (2/3) ... [2019-01-14 22:05:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d3eda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 10:05:31, skipping insertion in model container [2019-01-14 22:05:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:05:31" (3/3) ... [2019-01-14 22:05:31,300 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi02_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 22:05:31,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 22:05:31,318 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 22:05:31,332 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 22:05:31,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 22:05:31,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 22:05:31,364 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 22:05:31,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 22:05:31,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 22:05:31,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 22:05:31,364 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 22:05:31,364 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 22:05:31,364 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 22:05:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-14 22:05:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 22:05:31,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:31,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 22:05:31,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-14 22:05:31,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:31,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:31,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:31,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:31,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:31,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:05:31,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:05:31,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 22:05:31,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 22:05:31,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 22:05:31,724 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-14 22:05:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:31,918 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-14 22:05:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 22:05:31,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 22:05:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:31,928 INFO L225 Difference]: With dead ends: 33 [2019-01-14 22:05:31,928 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 22:05:31,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 22:05:31,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 22:05:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 22:05:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 22:05:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 22:05:31,972 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-14 22:05:31,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:31,973 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 22:05:31,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 22:05:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 22:05:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 22:05:31,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:31,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 22:05:31,974 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-14 22:05:31,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:31,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:31,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:31,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:32,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:05:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 22:05:32,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 22:05:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 22:05:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 22:05:32,059 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 22:05:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:32,219 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-14 22:05:32,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 22:05:32,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 22:05:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:32,223 INFO L225 Difference]: With dead ends: 39 [2019-01-14 22:05:32,223 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 22:05:32,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 22:05:32,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 22:05:32,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-14 22:05:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 22:05:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 22:05:32,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-14 22:05:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:32,236 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 22:05:32,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 22:05:32,236 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 22:05:32,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 22:05:32,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:32,238 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 22:05:32,238 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:32,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-14 22:05:32,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:32,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:32,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:32,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:32,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:32,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 22:05:32,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 22:05:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 22:05:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 22:05:32,585 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-14 22:05:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:32,748 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 22:05:32,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 22:05:32,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 22:05:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:32,750 INFO L225 Difference]: With dead ends: 55 [2019-01-14 22:05:32,751 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 22:05:32,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 22:05:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 22:05:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-14 22:05:32,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 22:05:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-14 22:05:32,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-14 22:05:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:32,762 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-14 22:05:32,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 22:05:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-14 22:05:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 22:05:32,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:32,764 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 22:05:32,764 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:32,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:32,765 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-14 22:05:32,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:32,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:32,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:32,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:32,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 22:05:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 22:05:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 22:05:32,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 22:05:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 22:05:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:05:32,898 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-14 22:05:32,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:32,972 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2019-01-14 22:05:32,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 22:05:32,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 22:05:32,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:32,976 INFO L225 Difference]: With dead ends: 65 [2019-01-14 22:05:32,976 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 22:05:32,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 22:05:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 22:05:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-14 22:05:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 22:05:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2019-01-14 22:05:32,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 14 [2019-01-14 22:05:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:32,994 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2019-01-14 22:05:32,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 22:05:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2019-01-14 22:05:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 22:05:32,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:32,995 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 22:05:32,996 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-14 22:05:32,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:32,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:32,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:32,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:33,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:33,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:33,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:05:33,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:05:33,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:33,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:33,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:33,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 22:05:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 22:05:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 22:05:33,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 22:05:33,233 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2019-01-14 22:05:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:33,744 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2019-01-14 22:05:33,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 22:05:33,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 22:05:33,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:33,746 INFO L225 Difference]: With dead ends: 86 [2019-01-14 22:05:33,747 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 22:05:33,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-14 22:05:33,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 22:05:33,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2019-01-14 22:05:33,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 22:05:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-01-14 22:05:33,764 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 17 [2019-01-14 22:05:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:33,764 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-01-14 22:05:33,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 22:05:33,764 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-01-14 22:05:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 22:05:33,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:33,765 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 22:05:33,768 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-14 22:05:33,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:33,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:33,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:33,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:33,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:33,985 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:05:34,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 22:05:34,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:34,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:34,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:34,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 22:05:34,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 22:05:34,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 22:05:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 22:05:34,044 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand 11 states. [2019-01-14 22:05:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:34,641 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2019-01-14 22:05:34,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 22:05:34,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 22:05:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:34,646 INFO L225 Difference]: With dead ends: 109 [2019-01-14 22:05:34,646 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 22:05:34,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-14 22:05:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 22:05:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-14 22:05:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-14 22:05:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-01-14 22:05:34,658 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 22 [2019-01-14 22:05:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:34,659 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-01-14 22:05:34,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 22:05:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2019-01-14 22:05:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 22:05:34,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:34,660 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 22:05:34,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:34,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-14 22:05:34,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:34,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:34,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:34,889 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:34,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:34,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:34,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:05:34,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:05:34,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:34,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:34,948 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:34,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:34,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 22:05:34,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 22:05:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 22:05:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-14 22:05:34,970 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand 13 states. [2019-01-14 22:05:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:35,316 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-01-14 22:05:35,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 22:05:35,317 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-14 22:05:35,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:35,320 INFO L225 Difference]: With dead ends: 132 [2019-01-14 22:05:35,320 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 22:05:35,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-01-14 22:05:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 22:05:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2019-01-14 22:05:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 22:05:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2019-01-14 22:05:35,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 27 [2019-01-14 22:05:35,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:35,346 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2019-01-14 22:05:35,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 22:05:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2019-01-14 22:05:35,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 22:05:35,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:35,349 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 22:05:35,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-14 22:05:35,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:35,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:35,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:35,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 22:05:35,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:35,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:35,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 22:05:35,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:35,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-14 22:05:35,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 22:05:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 22:05:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:05:35,578 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 8 states. [2019-01-14 22:05:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:35,662 INFO L93 Difference]: Finished difference Result 153 states and 200 transitions. [2019-01-14 22:05:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 22:05:35,664 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 22:05:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:35,667 INFO L225 Difference]: With dead ends: 153 [2019-01-14 22:05:35,667 INFO L226 Difference]: Without dead ends: 151 [2019-01-14 22:05:35,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:05:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-14 22:05:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2019-01-14 22:05:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-14 22:05:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2019-01-14 22:05:35,686 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 26 [2019-01-14 22:05:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:35,686 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2019-01-14 22:05:35,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 22:05:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2019-01-14 22:05:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 22:05:35,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:35,688 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 22:05:35,688 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -303136509, now seen corresponding path program 1 times [2019-01-14 22:05:35,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 22:05:35,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:35,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:35,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 22:05:35,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 22:05:35,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2019-01-14 22:05:35,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 22:05:35,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 22:05:35,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:05:35,990 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand 8 states. [2019-01-14 22:05:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:36,088 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2019-01-14 22:05:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 22:05:36,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 22:05:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:36,092 INFO L225 Difference]: With dead ends: 145 [2019-01-14 22:05:36,092 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 22:05:36,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 22:05:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 22:05:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-14 22:05:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 22:05:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-14 22:05:36,104 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 27 [2019-01-14 22:05:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:36,104 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-14 22:05:36,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 22:05:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-14 22:05:36,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 22:05:36,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:36,105 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-14 22:05:36,106 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:36,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-14 22:05:36,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:36,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:36,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:36,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:36,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:05:36,489 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 22:05:36,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:36,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:36,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:36,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 22:05:36,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 22:05:36,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 22:05:36,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-14 22:05:36,527 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-14 22:05:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:36,865 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-14 22:05:36,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 22:05:36,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-14 22:05:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:36,867 INFO L225 Difference]: With dead ends: 167 [2019-01-14 22:05:36,868 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 22:05:36,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-14 22:05:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 22:05:36,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-14 22:05:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 22:05:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-14 22:05:36,877 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-14 22:05:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:36,877 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-14 22:05:36,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 22:05:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-14 22:05:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 22:05:36,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:36,879 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 22:05:36,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-14 22:05:36,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:36,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 22:05:37,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:37,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:37,219 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 22:05:37,267 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 22:05:37,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:37,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 22:05:37,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:37,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-14 22:05:37,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 22:05:37,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 22:05:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-14 22:05:37,366 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-14 22:05:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:37,443 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-14 22:05:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 22:05:37,452 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-14 22:05:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:37,455 INFO L225 Difference]: With dead ends: 154 [2019-01-14 22:05:37,455 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 22:05:37,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-01-14 22:05:37,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 22:05:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-14 22:05:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-14 22:05:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-14 22:05:37,472 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-14 22:05:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:37,472 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-14 22:05:37,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 22:05:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-14 22:05:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 22:05:37,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:37,481 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 22:05:37,481 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:37,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:37,481 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-14 22:05:37,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:37,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:37,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 22:05:37,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:37,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:37,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:05:37,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:05:37,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:37,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 22:05:37,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:37,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-01-14 22:05:37,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 22:05:37,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 22:05:37,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 22:05:37,740 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 10 states. [2019-01-14 22:05:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:37,785 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-14 22:05:37,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 22:05:37,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-01-14 22:05:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:37,788 INFO L225 Difference]: With dead ends: 207 [2019-01-14 22:05:37,788 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 22:05:37,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 22:05:37,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 22:05:37,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-14 22:05:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 22:05:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-14 22:05:37,799 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-14 22:05:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:37,800 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 22:05:37,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 22:05:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-14 22:05:37,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 22:05:37,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:37,802 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-14 22:05:37,803 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:37,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-14 22:05:37,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:37,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:37,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:37,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:37,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 22:05:37,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:37,967 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:37,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:05:37,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 22:05:37,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:37,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-14 22:05:38,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:38,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2019-01-14 22:05:38,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 22:05:38,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 22:05:38,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 22:05:38,104 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 12 states. [2019-01-14 22:05:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:38,229 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-14 22:05:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 22:05:38,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-01-14 22:05:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:38,231 INFO L225 Difference]: With dead ends: 233 [2019-01-14 22:05:38,232 INFO L226 Difference]: Without dead ends: 204 [2019-01-14 22:05:38,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 22:05:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-14 22:05:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-14 22:05:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-14 22:05:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-14 22:05:38,243 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-14 22:05:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:38,244 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-14 22:05:38,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 22:05:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-14 22:05:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 22:05:38,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:38,252 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-14 22:05:38,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-14 22:05:38,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:38,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 22:05:38,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:38,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:38,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:05:38,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:05:38,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:38,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-14 22:05:38,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:38,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2019-01-14 22:05:38,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 22:05:38,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 22:05:38,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 22:05:38,820 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 14 states. [2019-01-14 22:05:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:38,944 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-14 22:05:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 22:05:38,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-14 22:05:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:38,948 INFO L225 Difference]: With dead ends: 252 [2019-01-14 22:05:38,948 INFO L226 Difference]: Without dead ends: 216 [2019-01-14 22:05:38,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 22:05:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-14 22:05:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-14 22:05:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 22:05:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-14 22:05:38,959 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-14 22:05:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:38,959 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-14 22:05:38,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 22:05:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-14 22:05:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 22:05:38,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:38,961 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-14 22:05:38,961 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-14 22:05:38,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:38,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 22:05:39,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:39,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:05:39,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 22:05:39,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:39,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:39,619 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-14 22:05:39,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:39,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2019-01-14 22:05:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 22:05:39,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 22:05:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 22:05:39,639 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 16 states. [2019-01-14 22:05:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:39,751 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-14 22:05:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 22:05:39,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-01-14 22:05:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:39,754 INFO L225 Difference]: With dead ends: 264 [2019-01-14 22:05:39,755 INFO L226 Difference]: Without dead ends: 223 [2019-01-14 22:05:39,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 22:05:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-14 22:05:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-14 22:05:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 22:05:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-14 22:05:39,766 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-14 22:05:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:39,766 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-14 22:05:39,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 22:05:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-14 22:05:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 22:05:39,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:39,768 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-14 22:05:39,768 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-14 22:05:39,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:39,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 22:05:39,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:39,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:39,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 22:05:40,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 22:05:40,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:40,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-01-14 22:05:40,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:40,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2019-01-14 22:05:40,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 22:05:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 22:05:40,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 22:05:40,218 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 18 states. [2019-01-14 22:05:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:40,367 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-14 22:05:40,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 22:05:40,369 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-01-14 22:05:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:40,371 INFO L225 Difference]: With dead ends: 271 [2019-01-14 22:05:40,372 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 22:05:40,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 22:05:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 22:05:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-14 22:05:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-14 22:05:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-14 22:05:40,389 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-14 22:05:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:40,389 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-14 22:05:40,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 22:05:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-14 22:05:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 22:05:40,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:40,393 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-14 22:05:40,394 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:40,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:40,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-14 22:05:40,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:40,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:40,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:40,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 22:05:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:40,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:40,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:40,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-01-14 22:05:40,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:40,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2019-01-14 22:05:40,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 22:05:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 22:05:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 22:05:40,830 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 20 states. [2019-01-14 22:05:41,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:41,088 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-14 22:05:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 22:05:41,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 98 [2019-01-14 22:05:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:41,091 INFO L225 Difference]: With dead ends: 278 [2019-01-14 22:05:41,091 INFO L226 Difference]: Without dead ends: 237 [2019-01-14 22:05:41,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 89 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 22:05:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-14 22:05:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-14 22:05:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 22:05:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-14 22:05:41,102 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-14 22:05:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:41,103 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-14 22:05:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 22:05:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-14 22:05:41,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 22:05:41,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:41,105 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-14 22:05:41,105 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:41,106 INFO L82 PathProgramCache]: Analyzing trace with hash 73375164, now seen corresponding path program 8 times [2019-01-14 22:05:41,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:41,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:41,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 22:05:41,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:41,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:05:41,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:05:41,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:41,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 860 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 22:05:41,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2019-01-14 22:05:41,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 22:05:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 22:05:41,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 22:05:41,841 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 22 states. [2019-01-14 22:05:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:42,345 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-14 22:05:42,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 22:05:42,346 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 145 [2019-01-14 22:05:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:42,348 INFO L225 Difference]: With dead ends: 285 [2019-01-14 22:05:42,348 INFO L226 Difference]: Without dead ends: 244 [2019-01-14 22:05:42,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 22:05:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-14 22:05:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-14 22:05:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 22:05:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-14 22:05:42,360 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 145 [2019-01-14 22:05:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:42,360 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-14 22:05:42,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 22:05:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-14 22:05:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 22:05:42,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:42,365 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-14 22:05:42,365 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-14 22:05:42,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:42,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:42,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 22:05:42,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:42,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:42,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:05:42,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 22:05:42,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:42,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 22:05:43,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:43,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2019-01-14 22:05:43,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 22:05:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 22:05:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 22:05:43,235 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 24 states. [2019-01-14 22:05:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:44,001 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-14 22:05:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 22:05:44,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 157 [2019-01-14 22:05:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:44,005 INFO L225 Difference]: With dead ends: 292 [2019-01-14 22:05:44,005 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 22:05:44,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 22:05:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 22:05:44,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-14 22:05:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-14 22:05:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-14 22:05:44,025 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-14 22:05:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:44,026 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-14 22:05:44,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 22:05:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-14 22:05:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-14 22:05:44,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:44,029 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-14 22:05:44,031 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:44,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-14 22:05:44,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:44,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:44,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 22:05:44,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:44,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:05:44,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:05:44,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:44,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 355 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-01-14 22:05:44,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:44,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2019-01-14 22:05:44,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 22:05:44,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 22:05:44,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 22:05:44,980 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 26 states. [2019-01-14 22:05:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:45,113 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-14 22:05:45,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 22:05:45,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 169 [2019-01-14 22:05:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:45,118 INFO L225 Difference]: With dead ends: 299 [2019-01-14 22:05:45,118 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 22:05:45,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 22:05:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 22:05:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-14 22:05:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 22:05:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-14 22:05:45,131 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-14 22:05:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:45,131 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-14 22:05:45,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 22:05:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-14 22:05:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-14 22:05:45,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:45,136 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-14 22:05:45,137 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:45,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1885455794, now seen corresponding path program 11 times [2019-01-14 22:05:45,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:45,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:45,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:45,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:45,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:45,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 22:05:45,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:45,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:45,861 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:05:45,934 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-01-14 22:05:45,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:45,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 22:05:46,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:46,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2019-01-14 22:05:46,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 22:05:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 22:05:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 22:05:46,292 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 28 states. [2019-01-14 22:05:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:46,600 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-14 22:05:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 22:05:46,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 181 [2019-01-14 22:05:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:46,602 INFO L225 Difference]: With dead ends: 306 [2019-01-14 22:05:46,603 INFO L226 Difference]: Without dead ends: 265 [2019-01-14 22:05:46,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 22:05:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-14 22:05:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-14 22:05:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-14 22:05:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-14 22:05:46,614 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 181 [2019-01-14 22:05:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:46,616 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-14 22:05:46,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 22:05:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-14 22:05:46,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 22:05:46,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:46,620 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-14 22:05:46,620 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-14 22:05:46,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:46,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:46,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:46,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 22:05:47,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:47,019 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 22:05:47,068 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-14 22:05:47,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:47,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 0 proven. 510 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-01-14 22:05:47,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:47,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2019-01-14 22:05:47,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 22:05:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 22:05:47,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 22:05:47,415 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 30 states. [2019-01-14 22:05:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:47,601 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-14 22:05:47,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 22:05:47,606 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 158 [2019-01-14 22:05:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:47,608 INFO L225 Difference]: With dead ends: 313 [2019-01-14 22:05:47,608 INFO L226 Difference]: Without dead ends: 272 [2019-01-14 22:05:47,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 22:05:47,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-14 22:05:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-14 22:05:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 22:05:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-14 22:05:47,622 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-14 22:05:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:47,622 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-14 22:05:47,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 22:05:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-14 22:05:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-14 22:05:47,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:47,627 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-14 22:05:47,628 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-14 22:05:47,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:47,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:47,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 22:05:48,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:48,531 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:48,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:48,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1690 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2019-01-14 22:05:48,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:48,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2019-01-14 22:05:48,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 22:05:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 22:05:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 22:05:48,899 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 32 states. [2019-01-14 22:05:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:49,078 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-14 22:05:49,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 22:05:49,081 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 205 [2019-01-14 22:05:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:49,084 INFO L225 Difference]: With dead ends: 320 [2019-01-14 22:05:49,084 INFO L226 Difference]: Without dead ends: 279 [2019-01-14 22:05:49,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 22:05:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-14 22:05:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-14 22:05:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-14 22:05:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-14 22:05:49,100 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-14 22:05:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:49,101 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-14 22:05:49,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 22:05:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-14 22:05:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-14 22:05:49,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:49,106 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-14 22:05:49,107 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1929171383, now seen corresponding path program 14 times [2019-01-14 22:05:49,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:49,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:49,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:49,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 22:05:50,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:50,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:05:50,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:05:50,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:50,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2019-01-14 22:05:51,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:51,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2019-01-14 22:05:51,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 22:05:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 22:05:51,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 22:05:51,020 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 34 states. [2019-01-14 22:05:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:51,250 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-14 22:05:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 22:05:51,251 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 182 [2019-01-14 22:05:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:51,254 INFO L225 Difference]: With dead ends: 327 [2019-01-14 22:05:51,254 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 22:05:51,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 166 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 22:05:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 22:05:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-14 22:05:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-14 22:05:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-14 22:05:51,264 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 182 [2019-01-14 22:05:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:51,264 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-14 22:05:51,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 22:05:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-14 22:05:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-14 22:05:51,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:51,269 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-14 22:05:51,271 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:51,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:51,271 INFO L82 PathProgramCache]: Analyzing trace with hash -799687031, now seen corresponding path program 15 times [2019-01-14 22:05:51,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:51,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:51,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 22:05:52,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:52,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:52,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:05:52,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 22:05:52,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:52,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1427 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-01-14 22:05:53,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:53,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 35 [2019-01-14 22:05:53,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 22:05:53,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 22:05:53,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 22:05:53,331 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 36 states. [2019-01-14 22:05:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:53,566 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-14 22:05:53,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 22:05:53,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 194 [2019-01-14 22:05:53,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:53,571 INFO L225 Difference]: With dead ends: 334 [2019-01-14 22:05:53,571 INFO L226 Difference]: Without dead ends: 293 [2019-01-14 22:05:53,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 177 SyntacticMatches, 15 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 22:05:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-14 22:05:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-14 22:05:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-14 22:05:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-14 22:05:53,584 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 194 [2019-01-14 22:05:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:53,584 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-14 22:05:53,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 22:05:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-14 22:05:53,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-14 22:05:53,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:53,589 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-14 22:05:53,589 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:53,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash 315334903, now seen corresponding path program 16 times [2019-01-14 22:05:53,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:53,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:53,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 22:05:54,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:54,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:54,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:05:54,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:05:54,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:54,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 714 trivial. 0 not checked. [2019-01-14 22:05:54,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:54,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2019-01-14 22:05:54,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 22:05:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 22:05:54,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 22:05:54,566 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 38 states. [2019-01-14 22:05:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:54,841 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-14 22:05:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 22:05:54,842 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 206 [2019-01-14 22:05:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:54,844 INFO L225 Difference]: With dead ends: 341 [2019-01-14 22:05:54,844 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 22:05:54,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 188 SyntacticMatches, 16 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 22:05:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 22:05:54,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-14 22:05:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-14 22:05:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-14 22:05:54,860 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 206 [2019-01-14 22:05:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:54,861 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-14 22:05:54,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 22:05:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-14 22:05:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-14 22:05:54,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:54,867 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-14 22:05:54,867 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:54,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-14 22:05:54,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:54,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:54,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:54,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 22:05:55,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:55,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:55,524 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:05:55,619 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-14 22:05:55,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:55,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 0 proven. 1020 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 22:05:56,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2019-01-14 22:05:56,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 22:05:56,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 22:05:56,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 22:05:56,068 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 40 states. [2019-01-14 22:05:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:56,485 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-14 22:05:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 22:05:56,486 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 253 [2019-01-14 22:05:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:56,491 INFO L225 Difference]: With dead ends: 348 [2019-01-14 22:05:56,491 INFO L226 Difference]: Without dead ends: 307 [2019-01-14 22:05:56,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 234 SyntacticMatches, 17 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 22:05:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-14 22:05:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-14 22:05:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-14 22:05:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-14 22:05:56,502 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-14 22:05:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:56,505 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-14 22:05:56,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 22:05:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-14 22:05:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-14 22:05:56,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:56,509 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-14 22:05:56,510 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-14 22:05:56,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:56,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:56,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 22:05:57,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:57,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:57,221 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 22:05:57,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-14 22:05:57,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:05:57,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2036 backedges. 0 proven. 1143 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2019-01-14 22:05:57,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2019-01-14 22:05:57,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 22:05:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 22:05:57,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 22:05:57,951 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 42 states. [2019-01-14 22:05:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:05:58,359 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-14 22:05:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 22:05:58,361 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 230 [2019-01-14 22:05:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:05:58,364 INFO L225 Difference]: With dead ends: 355 [2019-01-14 22:05:58,364 INFO L226 Difference]: Without dead ends: 314 [2019-01-14 22:05:58,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 210 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 22:05:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-14 22:05:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-14 22:05:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-14 22:05:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-14 22:05:58,374 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-14 22:05:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:05:58,375 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-14 22:05:58,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 22:05:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-14 22:05:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-01-14 22:05:58,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:05:58,377 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-14 22:05:58,377 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:05:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:05:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash 420240905, now seen corresponding path program 19 times [2019-01-14 22:05:58,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:05:58,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:05:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:58,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:05:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:05:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 22:05:59,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:05:59,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:05:59,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:05:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:05:59,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:05:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2263 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-14 22:05:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:05:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 43 [2019-01-14 22:05:59,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 22:05:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 22:05:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 22:05:59,825 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 44 states. [2019-01-14 22:06:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:00,117 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-14 22:06:00,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 22:06:00,118 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 242 [2019-01-14 22:06:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:00,121 INFO L225 Difference]: With dead ends: 362 [2019-01-14 22:06:00,121 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 22:06:00,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 221 SyntacticMatches, 19 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 22:06:00,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 22:06:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-14 22:06:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-14 22:06:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-14 22:06:00,132 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 242 [2019-01-14 22:06:00,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:00,132 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-14 22:06:00,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 22:06:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-14 22:06:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-14 22:06:00,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:00,134 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-14 22:06:00,135 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-14 22:06:00,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:00,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 22:06:01,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:01,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:06:01,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:06:01,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:06:01,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:01,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3356 backedges. 0 proven. 1410 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 22:06:02,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:02,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 45 [2019-01-14 22:06:02,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 22:06:02,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 22:06:02,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 22:06:02,298 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 46 states. [2019-01-14 22:06:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:02,581 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-14 22:06:02,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 22:06:02,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 289 [2019-01-14 22:06:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:02,586 INFO L225 Difference]: With dead ends: 369 [2019-01-14 22:06:02,586 INFO L226 Difference]: Without dead ends: 328 [2019-01-14 22:06:02,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 267 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 22:06:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-14 22:06:02,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-14 22:06:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-14 22:06:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-14 22:06:02,597 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-14 22:06:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:02,598 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-14 22:06:02,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 22:06:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-14 22:06:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-14 22:06:02,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:02,602 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-14 22:06:02,603 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1626433038, now seen corresponding path program 21 times [2019-01-14 22:06:02,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:02,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:02,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:02,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 22:06:03,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:03,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:06:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:06:03,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 22:06:03,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:03,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3642 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 2088 trivial. 0 not checked. [2019-01-14 22:06:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:05,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 47 [2019-01-14 22:06:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 22:06:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 22:06:05,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 22:06:05,686 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 48 states. [2019-01-14 22:06:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:05,936 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-14 22:06:05,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 22:06:05,937 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 301 [2019-01-14 22:06:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:05,941 INFO L225 Difference]: With dead ends: 376 [2019-01-14 22:06:05,941 INFO L226 Difference]: Without dead ends: 335 [2019-01-14 22:06:05,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 278 SyntacticMatches, 21 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 22:06:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-14 22:06:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-14 22:06:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-14 22:06:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-14 22:06:05,955 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 301 [2019-01-14 22:06:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:05,959 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-14 22:06:05,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 22:06:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-14 22:06:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-14 22:06:05,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:05,964 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 23, 23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-14 22:06:05,965 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-14 22:06:05,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:05,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:05,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:05,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:05,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:07,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:07,010 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:06:07,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:06:07,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:06:07,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:07,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 1705 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:07,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-01-14 22:06:07,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-14 22:06:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-14 22:06:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 22:06:07,827 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 50 states. [2019-01-14 22:06:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:08,097 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-14 22:06:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 22:06:08,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 313 [2019-01-14 22:06:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:08,101 INFO L225 Difference]: With dead ends: 383 [2019-01-14 22:06:08,101 INFO L226 Difference]: Without dead ends: 342 [2019-01-14 22:06:08,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 289 SyntacticMatches, 22 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2019-01-14 22:06:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-14 22:06:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-14 22:06:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-14 22:06:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-14 22:06:08,114 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-14 22:06:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:08,114 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-14 22:06:08,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-14 22:06:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-14 22:06:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-14 22:06:08,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:08,120 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-14 22:06:08,121 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash 117652873, now seen corresponding path program 23 times [2019-01-14 22:06:08,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:08,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:08,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:08,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:08,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:09,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 22:06:09,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:09,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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 [2019-01-14 22:06:09,640 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:06:09,714 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-01-14 22:06:09,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:09,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3291 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 22:06:10,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:10,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 51 [2019-01-14 22:06:10,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-14 22:06:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-14 22:06:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 22:06:10,399 INFO L87 Difference]: Start difference. First operand 336 states and 354 transitions. Second operand 52 states. [2019-01-14 22:06:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:10,702 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2019-01-14 22:06:10,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-14 22:06:10,704 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 290 [2019-01-14 22:06:10,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:10,707 INFO L225 Difference]: With dead ends: 390 [2019-01-14 22:06:10,707 INFO L226 Difference]: Without dead ends: 349 [2019-01-14 22:06:10,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 265 SyntacticMatches, 23 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 22:06:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-14 22:06:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 343. [2019-01-14 22:06:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-01-14 22:06:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 361 transitions. [2019-01-14 22:06:10,719 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 361 transitions. Word has length 290 [2019-01-14 22:06:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:10,719 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 361 transitions. [2019-01-14 22:06:10,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-14 22:06:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 361 transitions. [2019-01-14 22:06:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-01-14 22:06:10,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:10,725 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 25, 25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-14 22:06:10,726 INFO L423 AbstractCegarLoop]: === Iteration 34 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1252532292, now seen corresponding path program 24 times [2019-01-14 22:06:10,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:10,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:10,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:10,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:10,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 22:06:12,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:12,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 22:06:12,605 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-01-14 22:06:12,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:12,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4572 backedges. 0 proven. 2028 refuted. 0 times theorem prover too weak. 2544 trivial. 0 not checked. [2019-01-14 22:06:13,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:13,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 53 [2019-01-14 22:06:13,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-14 22:06:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-14 22:06:13,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 22:06:13,384 INFO L87 Difference]: Start difference. First operand 343 states and 361 transitions. Second operand 54 states. [2019-01-14 22:06:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:13,701 INFO L93 Difference]: Finished difference Result 397 states and 427 transitions. [2019-01-14 22:06:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-14 22:06:13,702 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 337 [2019-01-14 22:06:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:13,705 INFO L225 Difference]: With dead ends: 397 [2019-01-14 22:06:13,705 INFO L226 Difference]: Without dead ends: 356 [2019-01-14 22:06:13,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 311 SyntacticMatches, 24 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1664 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2019-01-14 22:06:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-14 22:06:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 350. [2019-01-14 22:06:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 22:06:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 368 transitions. [2019-01-14 22:06:13,716 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 368 transitions. Word has length 337 [2019-01-14 22:06:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 368 transitions. [2019-01-14 22:06:13,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-14 22:06:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 368 transitions. [2019-01-14 22:06:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-01-14 22:06:13,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:13,719 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 26, 26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-14 22:06:13,720 INFO L423 AbstractCegarLoop]: === Iteration 35 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1465194610, now seen corresponding path program 25 times [2019-01-14 22:06:13,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:13,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 2200 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2019-01-14 22:06:14,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:14,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:14,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 2340 proven. 1016 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2019-01-14 22:06:17,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:17,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 46] total 98 [2019-01-14 22:06:17,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-14 22:06:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-14 22:06:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=8282, Unknown=0, NotChecked=0, Total=9506 [2019-01-14 22:06:17,720 INFO L87 Difference]: Start difference. First operand 350 states and 368 transitions. Second operand 98 states. [2019-01-14 22:06:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:34,825 INFO L93 Difference]: Finished difference Result 599 states and 627 transitions. [2019-01-14 22:06:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-14 22:06:34,827 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 349 [2019-01-14 22:06:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:34,830 INFO L225 Difference]: With dead ends: 599 [2019-01-14 22:06:34,831 INFO L226 Difference]: Without dead ends: 359 [2019-01-14 22:06:34,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14185 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=8364, Invalid=49958, Unknown=0, NotChecked=0, Total=58322 [2019-01-14 22:06:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-14 22:06:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2019-01-14 22:06:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-01-14 22:06:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 359 transitions. [2019-01-14 22:06:34,850 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 359 transitions. Word has length 349 [2019-01-14 22:06:34,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:34,851 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 359 transitions. [2019-01-14 22:06:34,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-14 22:06:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 359 transitions. [2019-01-14 22:06:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-14 22:06:34,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:34,858 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-14 22:06:34,858 INFO L423 AbstractCegarLoop]: === Iteration 36 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1859894583, now seen corresponding path program 26 times [2019-01-14 22:06:34,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:34,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 22:06:34,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-14 22:06:36,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:36,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 22:06:36,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 22:06:36,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:36,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4188 backedges. 0 proven. 2379 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-14 22:06:37,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:37,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 57 [2019-01-14 22:06:37,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 22:06:37,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 22:06:37,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 22:06:37,137 INFO L87 Difference]: Start difference. First operand 350 states and 359 transitions. Second operand 58 states. [2019-01-14 22:06:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:37,423 INFO L93 Difference]: Finished difference Result 375 states and 387 transitions. [2019-01-14 22:06:37,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-14 22:06:37,425 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 326 [2019-01-14 22:06:37,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:37,428 INFO L225 Difference]: With dead ends: 375 [2019-01-14 22:06:37,428 INFO L226 Difference]: Without dead ends: 327 [2019-01-14 22:06:37,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 298 SyntacticMatches, 26 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2019-01-14 22:06:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-01-14 22:06:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2019-01-14 22:06:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-14 22:06:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 331 transitions. [2019-01-14 22:06:37,440 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 331 transitions. Word has length 326 [2019-01-14 22:06:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:37,440 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 331 transitions. [2019-01-14 22:06:37,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 22:06:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 331 transitions. [2019-01-14 22:06:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-14 22:06:37,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:37,446 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-14 22:06:37,447 INFO L423 AbstractCegarLoop]: === Iteration 37 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:37,447 INFO L82 PathProgramCache]: Analyzing trace with hash -195404535, now seen corresponding path program 27 times [2019-01-14 22:06:37,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:37,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:37,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:37,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:37,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 22:06:38,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:38,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:38,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 22:06:38,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-14 22:06:38,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:38,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4511 backedges. 0 proven. 2565 refuted. 0 times theorem prover too weak. 1946 trivial. 0 not checked. [2019-01-14 22:06:40,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:40,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-01-14 22:06:40,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-14 22:06:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-14 22:06:40,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 22:06:40,108 INFO L87 Difference]: Start difference. First operand 325 states and 331 transitions. Second operand 60 states. [2019-01-14 22:06:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:40,360 INFO L93 Difference]: Finished difference Result 342 states and 349 transitions. [2019-01-14 22:06:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-14 22:06:40,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 338 [2019-01-14 22:06:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:40,365 INFO L225 Difference]: With dead ends: 342 [2019-01-14 22:06:40,365 INFO L226 Difference]: Without dead ends: 294 [2019-01-14 22:06:40,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 309 SyntacticMatches, 27 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2019-01-14 22:06:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-14 22:06:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-14 22:06:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-14 22:06:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-01-14 22:06:40,376 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 338 [2019-01-14 22:06:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:40,377 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-01-14 22:06:40,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-14 22:06:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-01-14 22:06:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-14 22:06:40,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:40,382 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 29, 29, 29, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-14 22:06:40,382 INFO L423 AbstractCegarLoop]: === Iteration 38 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1815869028, now seen corresponding path program 28 times [2019-01-14 22:06:40,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:40,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:40,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:40,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:41,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:41,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:41,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 22:06:41,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 22:06:41,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:41,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4993 backedges. 0 proven. 2758 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 61 [2019-01-14 22:06:43,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-14 22:06:43,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-14 22:06:43,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 22:06:43,282 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 62 states. [2019-01-14 22:06:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:43,815 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2019-01-14 22:06:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-14 22:06:43,817 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 355 [2019-01-14 22:06:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:43,819 INFO L225 Difference]: With dead ends: 302 [2019-01-14 22:06:43,819 INFO L226 Difference]: Without dead ends: 254 [2019-01-14 22:06:43,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 325 SyntacticMatches, 28 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2222 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2019-01-14 22:06:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-14 22:06:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2019-01-14 22:06:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-14 22:06:43,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2019-01-14 22:06:43,825 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 355 [2019-01-14 22:06:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:43,826 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2019-01-14 22:06:43,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-14 22:06:43,826 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2019-01-14 22:06:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-01-14 22:06:43,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 22:06:43,831 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-14 22:06:43,832 INFO L423 AbstractCegarLoop]: === Iteration 39 === [hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 22:06:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 22:06:43,832 INFO L82 PathProgramCache]: Analyzing trace with hash 139723977, now seen corresponding path program 29 times [2019-01-14 22:06:43,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 22:06:43,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 22:06:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:43,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 22:06:43,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 22:06:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 22:06:45,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 2958 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:45,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 22:06:45,336 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 22:06:45,345 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 22:06:45,472 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-01-14 22:06:45,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 22:06:45,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 22:06:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 2958 refuted. 0 times theorem prover too weak. 2235 trivial. 0 not checked. [2019-01-14 22:06:46,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 22:06:46,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 63 [2019-01-14 22:06:46,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-14 22:06:46,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-14 22:06:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 22:06:46,549 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 64 states. [2019-01-14 22:06:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 22:06:47,030 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2019-01-14 22:06:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-14 22:06:47,032 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 362 [2019-01-14 22:06:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 22:06:47,033 INFO L225 Difference]: With dead ends: 254 [2019-01-14 22:06:47,033 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 22:06:47,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 331 SyntacticMatches, 29 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2374 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2019-01-14 22:06:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 22:06:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 22:06:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 22:06:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 22:06:47,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 362 [2019-01-14 22:06:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 22:06:47,036 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 22:06:47,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-14 22:06:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 22:06:47,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 22:06:47,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 22:06:47,412 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2019-01-14 22:06:47,417 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,417 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,417 INFO L444 ceAbstractionStarter]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (< |hanoi_#in~n| 1))) (and (or (< 30 |hanoi_#in~n|) .cse0 (<= hanoi_~n |hanoi_#in~n|)) (or .cse0 (< 31 |hanoi_#in~n|) (and (<= hanoi_~n 31) (<= 1 hanoi_~n) (not (= 1 hanoi_~n)))))) [2019-01-14 22:06:47,417 INFO L448 ceAbstractionStarter]: For program point hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,417 INFO L448 ceAbstractionStarter]: For program point hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,417 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point L22-3(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point L22-5(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point L22-7(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point hanoiEXIT(lines 18 23) no Hoare annotation was computed. [2019-01-14 22:06:47,418 INFO L451 ceAbstractionStarter]: At program point hanoiENTRY(lines 18 23) the Hoare annotation is: true [2019-01-14 22:06:47,418 INFO L448 ceAbstractionStarter]: For program point hanoiFINAL(lines 18 23) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 36) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 31)) [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2019-01-14 22:06:47,419 INFO L451 ceAbstractionStarter]: At program point L26(lines 26 37) the Hoare annotation is: true [2019-01-14 22:06:47,420 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-01-14 22:06:47,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 10:06:47 BoogieIcfgContainer [2019-01-14 22:06:47,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 22:06:47,426 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 22:06:47,426 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 22:06:47,426 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 22:06:47,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 10:05:31" (3/4) ... [2019-01-14 22:06:47,430 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 22:06:47,437 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2019-01-14 22:06:47,442 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 22:06:47,442 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 22:06:47,484 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 22:06:47,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 22:06:47,486 INFO L168 Benchmark]: Toolchain (without parser) took 76841.21 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 695.7 MB). Free memory was 954.0 MB in the beginning and 987.6 MB in the end (delta: -33.6 MB). Peak memory consumption was 662.1 MB. Max. memory is 11.5 GB. [2019-01-14 22:06:47,488 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 22:06:47,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.14 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-14 22:06:47,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.79 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 22:06:47,489 INFO L168 Benchmark]: Boogie Preprocessor took 14.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 22:06:47,492 INFO L168 Benchmark]: RCFGBuilder took 330.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-01-14 22:06:47,492 INFO L168 Benchmark]: TraceAbstraction took 76131.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 572.5 MB). Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 105.6 MB). Peak memory consumption was 678.1 MB. Max. memory is 11.5 GB. [2019-01-14 22:06:47,493 INFO L168 Benchmark]: Witness Printer took 59.36 ms. Allocated memory is still 1.7 GB. Free memory is still 987.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 22:06:47,500 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.14 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 942.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.79 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76131.14 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 572.5 MB). Free memory was 1.1 GB in the beginning and 987.6 MB in the end (delta: 105.6 MB). Peak memory consumption was 678.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.36 ms. Allocated memory is still 1.7 GB. Free memory is still 987.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 6 error locations. SAFE Result, 76.0s OverallTime, 39 OverallIterations, 34 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 636 SDtfs, 3454 SDslu, 10787 SDs, 0 SdLazy, 22484 SolverSat, 976 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7371 GetRequests, 5676 SyntacticMatches, 414 SemanticMatches, 1281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38009 ImplicationChecksByTransitivity, 45.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 234 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 20 PreInvPairs, 22 NumberOfFragments, 42 HoareAnnotationTreeSize, 20 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 12407 NumberOfCodeBlocks, 12312 NumberOfCodeBlocksAsserted, 351 NumberOfCheckSat, 12332 ConstructedInterpolants, 0 QuantifiedInterpolants, 6541650 SizeOfPredicates, 62 NumberOfNonLiveVariables, 10533 ConjunctsInSsa, 1048 ConjunctsInUnsatCore, 75 InterpolantComputations, 4 PerfectInterpolantSequences, 64318/123956 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...