./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/recursive/recHanoi03_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/recHanoi03_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 887ada769b510ae5d273618525924110908f2b5f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:56:27,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:56:27,364 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:56:27,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:56:27,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:56:27,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:56:27,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:56:27,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:56:27,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:56:27,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:56:27,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:56:27,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:56:27,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:56:27,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:56:27,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:56:27,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:56:27,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:56:27,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:56:27,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:56:27,401 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:56:27,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:56:27,404 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:56:27,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:56:27,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:56:27,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:56:27,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:56:27,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:56:27,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:56:27,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:56:27,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:56:27,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:56:27,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:56:27,418 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:56:27,418 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:56:27,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:56:27,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:56:27,423 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2019-01-14 01:56:27,450 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:56:27,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:56:27,452 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:56:27,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:56:27,453 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:56:27,453 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:56:27,453 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 01:56:27,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:56:27,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:56:27,454 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 01:56:27,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:56:27,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:56:27,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:56:27,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:56:27,456 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:56:27,456 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 01:56:27,457 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:56:27,457 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:56:27,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:56:27,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:56:27,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:56:27,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:56:27,458 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:56:27,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:56:27,458 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:56:27,458 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:56:27,458 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:56:27,459 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:56:27,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:56:27,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:56:27,462 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 -> 887ada769b510ae5d273618525924110908f2b5f [2019-01-14 01:56:27,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:56:27,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:56:27,535 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:56:27,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:56:27,539 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:56:27,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:27,599 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befb659c5/effb5d447e014a9d9d2426f87931127f/FLAGdc642ad68 [2019-01-14 01:56:28,054 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:56:28,054 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:28,061 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befb659c5/effb5d447e014a9d9d2426f87931127f/FLAGdc642ad68 [2019-01-14 01:56:28,426 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/befb659c5/effb5d447e014a9d9d2426f87931127f [2019-01-14 01:56:28,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:56:28,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:56:28,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:56:28,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:56:28,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:56:28,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e263d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28, skipping insertion in model container [2019-01-14 01:56:28,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:56:28,473 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:56:28,687 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:56:28,691 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:56:28,705 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:56:28,718 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:56:28,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28 WrapperNode [2019-01-14 01:56:28,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:56:28,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:56:28,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:56:28,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:56:28,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:56:28,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:56:28,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:56:28,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:56:28,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (1/1) ... [2019-01-14 01:56:28,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:56:28,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:56:28,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:56:28,781 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:56:28,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (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 01:56:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2019-01-14 01:56:28,909 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2019-01-14 01:56:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:56:28,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:56:29,167 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:56:29,167 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 01:56:29,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:56:29 BoogieIcfgContainer [2019-01-14 01:56:29,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:56:29,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:56:29,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:56:29,173 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:56:29,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:56:28" (1/3) ... [2019-01-14 01:56:29,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc1a09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:56:29, skipping insertion in model container [2019-01-14 01:56:29,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:56:28" (2/3) ... [2019-01-14 01:56:29,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc1a09d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:56:29, skipping insertion in model container [2019-01-14 01:56:29,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:56:29" (3/3) ... [2019-01-14 01:56:29,176 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03_true-unreach-call_true-no-overflow_true-termination.c [2019-01-14 01:56:29,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:56:29,192 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:56:29,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:56:29,234 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:56:29,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:56:29,235 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:56:29,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:56:29,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:56:29,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:56:29,236 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:56:29,236 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:56:29,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:56:29,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-01-14 01:56:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:56:29,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:29,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:56:29,264 INFO L423 AbstractCegarLoop]: === Iteration 1 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1513948958, now seen corresponding path program 1 times [2019-01-14 01:56:29,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:29,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:29,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:29,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:29,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:29,539 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 01:56:29,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:29,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:56:29,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:56:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:56:29,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:56:29,560 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2019-01-14 01:56:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:29,701 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-14 01:56:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:56:29,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 01:56:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:29,711 INFO L225 Difference]: With dead ends: 33 [2019-01-14 01:56:29,711 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 01:56:29,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 01:56:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 01:56:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 01:56:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 01:56:29,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 6 [2019-01-14 01:56:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:29,751 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 01:56:29,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:56:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 01:56:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:56:29,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:29,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:29,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash -312222520, now seen corresponding path program 1 times [2019-01-14 01:56:29,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:29,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:29,821 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 01:56:29,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:56:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:56:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:56:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:56:29,824 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 01:56:30,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:30,131 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-01-14 01:56:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:56:30,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-14 01:56:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:30,137 INFO L225 Difference]: With dead ends: 39 [2019-01-14 01:56:30,137 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 01:56:30,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 01:56:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-14 01:56:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 01:56:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-01-14 01:56:30,149 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2019-01-14 01:56:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:30,150 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-01-14 01:56:30,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:56:30,150 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-01-14 01:56:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:56:30,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:30,152 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:30,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1144431293, now seen corresponding path program 1 times [2019-01-14 01:56:30,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:30,302 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 01:56:30,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:30,303 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 01:56:30,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:30,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:30,374 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 01:56:30,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:30,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 01:56:30,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 01:56:30,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 01:56:30,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 01:56:30,397 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 7 states. [2019-01-14 01:56:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:30,650 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-14 01:56:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:56:30,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 01:56:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:30,652 INFO L225 Difference]: With dead ends: 55 [2019-01-14 01:56:30,653 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 01:56:30,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:56:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 01:56:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2019-01-14 01:56:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 01:56:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-14 01:56:30,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 12 [2019-01-14 01:56:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:30,665 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-14 01:56:30,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 01:56:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-14 01:56:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 01:56:30,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:30,667 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:30,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:30,668 INFO L82 PathProgramCache]: Analyzing trace with hash -287349001, now seen corresponding path program 1 times [2019-01-14 01:56:30,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:30,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:30,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:30,752 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 01:56:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:56:30,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:56:30,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:56:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:56:30,754 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-14 01:56:30,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:30,814 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2019-01-14 01:56:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:56:30,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-14 01:56:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:30,818 INFO L225 Difference]: With dead ends: 63 [2019-01-14 01:56:30,818 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 01:56:30,819 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 01:56:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 01:56:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2019-01-14 01:56:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 01:56:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-01-14 01:56:30,836 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 14 [2019-01-14 01:56:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:30,837 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-01-14 01:56:30,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:56:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-01-14 01:56:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 01:56:30,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:30,838 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:56:30,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -317884395, now seen corresponding path program 1 times [2019-01-14 01:56:30,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:30,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:30,925 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 01:56:30,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:56:30,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 01:56:30,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:56:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:56:30,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:56:30,927 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 4 states. [2019-01-14 01:56:30,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:30,962 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-01-14 01:56:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:56:30,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 01:56:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:30,964 INFO L225 Difference]: With dead ends: 58 [2019-01-14 01:56:30,964 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 01:56:30,965 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 01:56:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 01:56:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-14 01:56:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 01:56:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-01-14 01:56:30,973 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-01-14 01:56:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-01-14 01:56:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:56:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-01-14 01:56:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:56:30,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:30,974 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-01-14 01:56:30,975 INFO L423 AbstractCegarLoop]: === Iteration 6 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:30,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1656222120, now seen corresponding path program 2 times [2019-01-14 01:56:30,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:30,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:31,104 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 01:56:31,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:31,105 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 01:56:31,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:56:31,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:56:31,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:31,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:31,135 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 01:56:31,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:31,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 01:56:31,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:56:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:56:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:56:31,162 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 9 states. [2019-01-14 01:56:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:31,641 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2019-01-14 01:56:31,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 01:56:31,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-01-14 01:56:31,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:31,648 INFO L225 Difference]: With dead ends: 74 [2019-01-14 01:56:31,648 INFO L226 Difference]: Without dead ends: 73 [2019-01-14 01:56:31,648 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 01:56:31,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-14 01:56:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-01-14 01:56:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 01:56:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-01-14 01:56:31,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 17 [2019-01-14 01:56:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:31,661 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-01-14 01:56:31,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:56:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-01-14 01:56:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:56:31,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:31,662 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2019-01-14 01:56:31,663 INFO L423 AbstractCegarLoop]: === Iteration 7 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:31,663 INFO L82 PathProgramCache]: Analyzing trace with hash 438260835, now seen corresponding path program 3 times [2019-01-14 01:56:31,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:31,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:31,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:31,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:31,874 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 01:56:31,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:31,874 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 01:56:31,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:56:31,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:56:31,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:31,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:31,929 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 01:56:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 01:56:31,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 01:56:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 01:56:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 01:56:31,954 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand 11 states. [2019-01-14 01:56:32,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:32,376 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-14 01:56:32,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:56:32,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-01-14 01:56:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:32,378 INFO L225 Difference]: With dead ends: 94 [2019-01-14 01:56:32,378 INFO L226 Difference]: Without dead ends: 93 [2019-01-14 01:56:32,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-01-14 01:56:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-14 01:56:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-01-14 01:56:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-14 01:56:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2019-01-14 01:56:32,392 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 22 [2019-01-14 01:56:32,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:32,392 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2019-01-14 01:56:32,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 01:56:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2019-01-14 01:56:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 01:56:32,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:32,395 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2019-01-14 01:56:32,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:32,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1696558728, now seen corresponding path program 4 times [2019-01-14 01:56:32,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:32,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:32,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:32,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:32,704 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 01:56:32,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:32,704 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 01:56:32,720 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:56:32,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:56:32,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:32,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:32,748 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 01:56:32,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-14 01:56:32,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:56:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:56:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:56:32,772 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand 13 states. [2019-01-14 01:56:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:33,095 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2019-01-14 01:56:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 01:56:33,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-14 01:56:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:33,097 INFO L225 Difference]: With dead ends: 114 [2019-01-14 01:56:33,097 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 01:56:33,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-01-14 01:56:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 01:56:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2019-01-14 01:56:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 01:56:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2019-01-14 01:56:33,116 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 27 [2019-01-14 01:56:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:33,117 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2019-01-14 01:56:33,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:56:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2019-01-14 01:56:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:56:33,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:33,119 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 01:56:33,119 INFO L423 AbstractCegarLoop]: === Iteration 9 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -563967927, now seen corresponding path program 1 times [2019-01-14 01:56:33,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:33,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:33,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:33,193 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 01:56:33,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:33,194 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 01:56:33,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:33,256 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 01:56:33,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:33,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 01:56:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 01:56:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 01:56:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:33,277 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand 6 states. [2019-01-14 01:56:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:33,328 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2019-01-14 01:56:33,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:56:33,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 01:56:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:33,331 INFO L225 Difference]: With dead ends: 149 [2019-01-14 01:56:33,331 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 01:56:33,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:56:33,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 01:56:33,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2019-01-14 01:56:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 01:56:33,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-01-14 01:56:33,352 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 26 [2019-01-14 01:56:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:33,353 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-01-14 01:56:33,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 01:56:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-01-14 01:56:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 01:56:33,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:33,354 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2019-01-14 01:56:33,355 INFO L423 AbstractCegarLoop]: === Iteration 10 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:33,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1757224061, now seen corresponding path program 5 times [2019-01-14 01:56:33,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:33,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:33,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:33,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:33,657 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 01:56:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:33,657 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 01:56:33,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:56:33,780 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 01:56:33,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:33,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:33,795 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 01:56:33,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:33,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-14 01:56:33,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 01:56:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 01:56:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:56:33,826 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 15 states. [2019-01-14 01:56:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:34,266 INFO L93 Difference]: Finished difference Result 167 states and 173 transitions. [2019-01-14 01:56:34,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 01:56:34,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-01-14 01:56:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:34,268 INFO L225 Difference]: With dead ends: 167 [2019-01-14 01:56:34,268 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 01:56:34,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:56:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 01:56:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-01-14 01:56:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-01-14 01:56:34,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2019-01-14 01:56:34,281 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 32 [2019-01-14 01:56:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:34,282 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2019-01-14 01:56:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 01:56:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2019-01-14 01:56:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 01:56:34,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:34,283 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2019-01-14 01:56:34,284 INFO L423 AbstractCegarLoop]: === Iteration 11 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:34,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:34,284 INFO L82 PathProgramCache]: Analyzing trace with hash -512208024, now seen corresponding path program 6 times [2019-01-14 01:56:34,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:34,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:34,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:34,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:34,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:34,674 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 01:56:34,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:34,675 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 01:56:34,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:56:34,724 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 01:56:34,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:34,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:34,796 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 01:56:34,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:34,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 17 [2019-01-14 01:56:34,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 01:56:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 01:56:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:56:34,818 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 18 states. [2019-01-14 01:56:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:34,873 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2019-01-14 01:56:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 01:56:34,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-14 01:56:34,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:34,877 INFO L225 Difference]: With dead ends: 154 [2019-01-14 01:56:34,877 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 01:56:34,878 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 01:56:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 01:56:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-14 01:56:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-14 01:56:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions. [2019-01-14 01:56:34,888 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 37 [2019-01-14 01:56:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:34,888 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 171 transitions. [2019-01-14 01:56:34,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 01:56:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions. [2019-01-14 01:56:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 01:56:34,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:34,890 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 01:56:34,891 INFO L423 AbstractCegarLoop]: === Iteration 12 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash 867149367, now seen corresponding path program 2 times [2019-01-14 01:56:34,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:34,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:35,017 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 01:56:35,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:35,017 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 01:56:35,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:56:35,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:56:35,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:35,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:35,101 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 01:56:35,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:35,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 01:56:35,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 01:56:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 01:56:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:56:35,121 INFO L87 Difference]: Start difference. First operand 153 states and 171 transitions. Second operand 8 states. [2019-01-14 01:56:35,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:35,186 INFO L93 Difference]: Finished difference Result 207 states and 237 transitions. [2019-01-14 01:56:35,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 01:56:35,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-01-14 01:56:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:35,191 INFO L225 Difference]: With dead ends: 207 [2019-01-14 01:56:35,191 INFO L226 Difference]: Without dead ends: 185 [2019-01-14 01:56:35,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 01:56:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-14 01:56:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2019-01-14 01:56:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-14 01:56:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 197 transitions. [2019-01-14 01:56:35,202 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 197 transitions. Word has length 38 [2019-01-14 01:56:35,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:35,205 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 197 transitions. [2019-01-14 01:56:35,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 01:56:35,205 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 197 transitions. [2019-01-14 01:56:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 01:56:35,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:35,208 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 01:56:35,208 INFO L423 AbstractCegarLoop]: === Iteration 13 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1066180599, now seen corresponding path program 3 times [2019-01-14 01:56:35,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:35,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:35,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:35,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:35,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:35,325 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 01:56:35,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:35,326 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 01:56:35,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:56:35,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 01:56:35,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:35,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:35,425 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 01:56:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:35,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 01:56:35,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 01:56:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 01:56:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:56:35,445 INFO L87 Difference]: Start difference. First operand 179 states and 197 transitions. Second operand 10 states. [2019-01-14 01:56:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:35,578 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2019-01-14 01:56:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:56:35,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-01-14 01:56:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:35,583 INFO L225 Difference]: With dead ends: 233 [2019-01-14 01:56:35,583 INFO L226 Difference]: Without dead ends: 204 [2019-01-14 01:56:35,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 01:56:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-14 01:56:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198. [2019-01-14 01:56:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-01-14 01:56:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2019-01-14 01:56:35,595 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 50 [2019-01-14 01:56:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:35,596 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2019-01-14 01:56:35,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 01:56:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2019-01-14 01:56:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 01:56:35,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:35,600 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 01:56:35,601 INFO L423 AbstractCegarLoop]: === Iteration 14 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -158018185, now seen corresponding path program 4 times [2019-01-14 01:56:35,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:35,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:35,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:35,841 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 01:56:35,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:35,841 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 01:56:35,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:56:35,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:56:35,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:35,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:36,186 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 01:56:36,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:36,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-14 01:56:36,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 01:56:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 01:56:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:56:36,209 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 12 states. [2019-01-14 01:56:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:36,281 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2019-01-14 01:56:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 01:56:36,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-01-14 01:56:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:36,288 INFO L225 Difference]: With dead ends: 252 [2019-01-14 01:56:36,288 INFO L226 Difference]: Without dead ends: 216 [2019-01-14 01:56:36,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-01-14 01:56:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-14 01:56:36,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2019-01-14 01:56:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-14 01:56:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2019-01-14 01:56:36,300 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 62 [2019-01-14 01:56:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:36,302 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2019-01-14 01:56:36,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 01:56:36,302 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2019-01-14 01:56:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 01:56:36,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:36,305 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 01:56:36,305 INFO L423 AbstractCegarLoop]: === Iteration 15 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:36,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:36,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1955313719, now seen corresponding path program 5 times [2019-01-14 01:56:36,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:36,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:36,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:36,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:36,460 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 01:56:36,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:36,460 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 01:56:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:56:36,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 01:56:36,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:36,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:36,860 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 01:56:36,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:36,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-14 01:56:36,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 01:56:36,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 01:56:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:56:36,881 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 14 states. [2019-01-14 01:56:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:36,990 INFO L93 Difference]: Finished difference Result 264 states and 294 transitions. [2019-01-14 01:56:36,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 01:56:36,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-01-14 01:56:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:36,993 INFO L225 Difference]: With dead ends: 264 [2019-01-14 01:56:36,993 INFO L226 Difference]: Without dead ends: 223 [2019-01-14 01:56:36,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:56:36,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-14 01:56:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 217. [2019-01-14 01:56:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-14 01:56:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 235 transitions. [2019-01-14 01:56:37,005 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 235 transitions. Word has length 74 [2019-01-14 01:56:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:37,006 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 235 transitions. [2019-01-14 01:56:37,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 01:56:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 235 transitions. [2019-01-14 01:56:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-14 01:56:37,010 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:37,010 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 01:56:37,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:37,011 INFO L82 PathProgramCache]: Analyzing trace with hash -330632009, now seen corresponding path program 6 times [2019-01-14 01:56:37,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:37,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:37,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:37,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:37,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:37,278 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 01:56:37,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:37,279 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 01:56:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:56:37,350 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 01:56:37,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:37,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:37,542 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 01:56:37,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:37,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-14 01:56:37,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 01:56:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 01:56:37,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:56:37,564 INFO L87 Difference]: Start difference. First operand 217 states and 235 transitions. Second operand 16 states. [2019-01-14 01:56:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:37,789 INFO L93 Difference]: Finished difference Result 271 states and 301 transitions. [2019-01-14 01:56:37,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 01:56:37,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-01-14 01:56:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:37,794 INFO L225 Difference]: With dead ends: 271 [2019-01-14 01:56:37,794 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 01:56:37,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-01-14 01:56:37,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 01:56:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2019-01-14 01:56:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-14 01:56:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 242 transitions. [2019-01-14 01:56:37,808 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 242 transitions. Word has length 86 [2019-01-14 01:56:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:37,809 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 242 transitions. [2019-01-14 01:56:37,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 01:56:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 242 transitions. [2019-01-14 01:56:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-14 01:56:37,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:37,812 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 01:56:37,813 INFO L423 AbstractCegarLoop]: === Iteration 17 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1775681655, now seen corresponding path program 7 times [2019-01-14 01:56:37,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:37,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:37,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:37,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:37,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:38,055 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 01:56:38,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:38,056 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 01:56:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:38,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:38,230 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 01:56:38,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:38,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-14 01:56:38,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 01:56:38,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 01:56:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:56:38,249 INFO L87 Difference]: Start difference. First operand 224 states and 242 transitions. Second operand 18 states. [2019-01-14 01:56:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:38,742 INFO L93 Difference]: Finished difference Result 278 states and 308 transitions. [2019-01-14 01:56:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 01:56:38,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-01-14 01:56:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:38,746 INFO L225 Difference]: With dead ends: 278 [2019-01-14 01:56:38,746 INFO L226 Difference]: Without dead ends: 237 [2019-01-14 01:56:38,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-01-14 01:56:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-01-14 01:56:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-01-14 01:56:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-14 01:56:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2019-01-14 01:56:38,759 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 98 [2019-01-14 01:56:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:38,760 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2019-01-14 01:56:38,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 01:56:38,761 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2019-01-14 01:56:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-14 01:56:38,763 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:38,763 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-14 01:56:38,764 INFO L423 AbstractCegarLoop]: === Iteration 18 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1888355319, now seen corresponding path program 8 times [2019-01-14 01:56:38,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:38,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:38,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-01-14 01:56:39,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:39,008 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 01:56:39,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:56:39,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:56:39,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:39,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-01-14 01:56:39,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-14 01:56:39,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 01:56:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 01:56:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:56:39,253 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand 20 states. [2019-01-14 01:56:39,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:39,413 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2019-01-14 01:56:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 01:56:39,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 110 [2019-01-14 01:56:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:39,418 INFO L225 Difference]: With dead ends: 285 [2019-01-14 01:56:39,419 INFO L226 Difference]: Without dead ends: 244 [2019-01-14 01:56:39,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-01-14 01:56:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-14 01:56:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2019-01-14 01:56:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-14 01:56:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 256 transitions. [2019-01-14 01:56:39,433 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 256 transitions. Word has length 110 [2019-01-14 01:56:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:39,433 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 256 transitions. [2019-01-14 01:56:39,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 01:56:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 256 transitions. [2019-01-14 01:56:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-01-14 01:56:39,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:39,438 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 01:56:39,439 INFO L423 AbstractCegarLoop]: === Iteration 19 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:39,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -329358962, now seen corresponding path program 9 times [2019-01-14 01:56:39,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:39,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:39,816 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 01:56:39,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:39,816 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 01:56:39,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:56:39,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 01:56:39,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:39,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:40,125 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 01:56:40,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:40,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-14 01:56:40,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 01:56:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 01:56:40,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:56:40,145 INFO L87 Difference]: Start difference. First operand 238 states and 256 transitions. Second operand 22 states. [2019-01-14 01:56:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:40,490 INFO L93 Difference]: Finished difference Result 292 states and 322 transitions. [2019-01-14 01:56:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 01:56:40,491 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 157 [2019-01-14 01:56:40,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:40,493 INFO L225 Difference]: With dead ends: 292 [2019-01-14 01:56:40,493 INFO L226 Difference]: Without dead ends: 251 [2019-01-14 01:56:40,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-14 01:56:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-14 01:56:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2019-01-14 01:56:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-14 01:56:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 263 transitions. [2019-01-14 01:56:40,504 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 263 transitions. Word has length 157 [2019-01-14 01:56:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:40,505 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 263 transitions. [2019-01-14 01:56:40,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 01:56:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 263 transitions. [2019-01-14 01:56:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-14 01:56:40,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:40,510 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 01:56:40,510 INFO L423 AbstractCegarLoop]: === Iteration 20 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:40,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1310449148, now seen corresponding path program 10 times [2019-01-14 01:56:40,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:40,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:40,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:40,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:41,217 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 01:56:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:41,218 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 01:56:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:56:41,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:56:41,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:41,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:41,575 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 01:56:41,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-14 01:56:41,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 01:56:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 01:56:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:56:41,594 INFO L87 Difference]: Start difference. First operand 245 states and 263 transitions. Second operand 24 states. [2019-01-14 01:56:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:41,898 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2019-01-14 01:56:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 01:56:41,899 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2019-01-14 01:56:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:41,902 INFO L225 Difference]: With dead ends: 299 [2019-01-14 01:56:41,902 INFO L226 Difference]: Without dead ends: 258 [2019-01-14 01:56:41,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 159 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2019-01-14 01:56:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-14 01:56:41,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 252. [2019-01-14 01:56:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-14 01:56:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 270 transitions. [2019-01-14 01:56:41,914 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 270 transitions. Word has length 169 [2019-01-14 01:56:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:41,914 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 270 transitions. [2019-01-14 01:56:41,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 01:56:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 270 transitions. [2019-01-14 01:56:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-14 01:56:41,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:41,918 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-14 01:56:41,919 INFO L423 AbstractCegarLoop]: === Iteration 21 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:41,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1656708873, now seen corresponding path program 11 times [2019-01-14 01:56:41,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:41,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:41,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:41,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:41,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-01-14 01:56:42,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:42,634 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 01:56:42,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:56:42,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-01-14 01:56:42,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:42,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-01-14 01:56:43,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:43,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2019-01-14 01:56:43,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-14 01:56:43,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-14 01:56:43,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:56:43,064 INFO L87 Difference]: Start difference. First operand 252 states and 270 transitions. Second operand 26 states. [2019-01-14 01:56:43,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:43,328 INFO L93 Difference]: Finished difference Result 306 states and 336 transitions. [2019-01-14 01:56:43,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 01:56:43,329 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 146 [2019-01-14 01:56:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:43,333 INFO L225 Difference]: With dead ends: 306 [2019-01-14 01:56:43,333 INFO L226 Difference]: Without dead ends: 265 [2019-01-14 01:56:43,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 135 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2019-01-14 01:56:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-14 01:56:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2019-01-14 01:56:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-14 01:56:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 277 transitions. [2019-01-14 01:56:43,347 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 277 transitions. Word has length 146 [2019-01-14 01:56:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:43,347 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 277 transitions. [2019-01-14 01:56:43,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-14 01:56:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 277 transitions. [2019-01-14 01:56:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-14 01:56:43,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:43,352 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 01:56:43,352 INFO L423 AbstractCegarLoop]: === Iteration 22 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1454043767, now seen corresponding path program 12 times [2019-01-14 01:56:43,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:43,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:43,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:44,487 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 01:56:44,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:44,488 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 01:56:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:56:44,564 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-01-14 01:56:44,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:44,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:44,880 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 01:56:44,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:44,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2019-01-14 01:56:44,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-14 01:56:44,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-14 01:56:44,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 01:56:44,901 INFO L87 Difference]: Start difference. First operand 259 states and 277 transitions. Second operand 28 states. [2019-01-14 01:56:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:45,094 INFO L93 Difference]: Finished difference Result 313 states and 343 transitions. [2019-01-14 01:56:45,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 01:56:45,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 158 [2019-01-14 01:56:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:45,099 INFO L225 Difference]: With dead ends: 313 [2019-01-14 01:56:45,099 INFO L226 Difference]: Without dead ends: 272 [2019-01-14 01:56:45,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 146 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-01-14 01:56:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-14 01:56:45,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2019-01-14 01:56:45,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-14 01:56:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 284 transitions. [2019-01-14 01:56:45,110 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 284 transitions. Word has length 158 [2019-01-14 01:56:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:45,112 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 284 transitions. [2019-01-14 01:56:45,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-14 01:56:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 284 transitions. [2019-01-14 01:56:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-14 01:56:45,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:45,115 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 01:56:45,117 INFO L423 AbstractCegarLoop]: === Iteration 23 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 350954254, now seen corresponding path program 13 times [2019-01-14 01:56:45,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:45,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:45,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:45,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:46,459 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 01:56:46,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:46,460 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 01:56:46,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:46,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:46,893 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 01:56:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:46,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2019-01-14 01:56:46,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 01:56:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 01:56:46,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:56:46,914 INFO L87 Difference]: Start difference. First operand 266 states and 284 transitions. Second operand 30 states. [2019-01-14 01:56:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:47,146 INFO L93 Difference]: Finished difference Result 320 states and 350 transitions. [2019-01-14 01:56:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 01:56:47,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 205 [2019-01-14 01:56:47,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:47,150 INFO L225 Difference]: With dead ends: 320 [2019-01-14 01:56:47,150 INFO L226 Difference]: Without dead ends: 279 [2019-01-14 01:56:47,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 192 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2019-01-14 01:56:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-14 01:56:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2019-01-14 01:56:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-14 01:56:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 291 transitions. [2019-01-14 01:56:47,166 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 291 transitions. Word has length 205 [2019-01-14 01:56:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:47,167 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 291 transitions. [2019-01-14 01:56:47,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 01:56:47,168 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 291 transitions. [2019-01-14 01:56:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-01-14 01:56:47,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:47,171 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-14 01:56:47,171 INFO L423 AbstractCegarLoop]: === Iteration 24 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:47,171 INFO L82 PathProgramCache]: Analyzing trace with hash -419025284, now seen corresponding path program 14 times [2019-01-14 01:56:47,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:47,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:47,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-14 01:56:47,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:47,686 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 01:56:47,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:56:47,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:56:47,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:47,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 693 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-14 01:56:48,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:48,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2019-01-14 01:56:48,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 01:56:48,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 01:56:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:56:48,606 INFO L87 Difference]: Start difference. First operand 273 states and 291 transitions. Second operand 32 states. [2019-01-14 01:56:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:48,805 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2019-01-14 01:56:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 01:56:48,806 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 217 [2019-01-14 01:56:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:48,809 INFO L225 Difference]: With dead ends: 327 [2019-01-14 01:56:48,809 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 01:56:48,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 203 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-01-14 01:56:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 01:56:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 280. [2019-01-14 01:56:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-01-14 01:56:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 298 transitions. [2019-01-14 01:56:48,821 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 298 transitions. Word has length 217 [2019-01-14 01:56:48,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:48,822 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 298 transitions. [2019-01-14 01:56:48,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 01:56:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 298 transitions. [2019-01-14 01:56:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-01-14 01:56:48,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:48,826 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-14 01:56:48,827 INFO L423 AbstractCegarLoop]: === Iteration 25 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash 537467854, now seen corresponding path program 15 times [2019-01-14 01:56:48,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:48,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:48,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-14 01:56:49,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:49,941 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 01:56:49,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:56:50,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-14 01:56:50,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:50,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2106 backedges. 0 proven. 795 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-14 01:56:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2019-01-14 01:56:50,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 01:56:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 01:56:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:56:50,768 INFO L87 Difference]: Start difference. First operand 280 states and 298 transitions. Second operand 34 states. [2019-01-14 01:56:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:50,975 INFO L93 Difference]: Finished difference Result 334 states and 364 transitions. [2019-01-14 01:56:50,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 01:56:50,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 229 [2019-01-14 01:56:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:50,979 INFO L225 Difference]: With dead ends: 334 [2019-01-14 01:56:50,979 INFO L226 Difference]: Without dead ends: 293 [2019-01-14 01:56:50,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 214 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 01:56:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-01-14 01:56:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2019-01-14 01:56:50,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-14 01:56:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 305 transitions. [2019-01-14 01:56:50,991 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 305 transitions. Word has length 229 [2019-01-14 01:56:50,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:50,992 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 305 transitions. [2019-01-14 01:56:50,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 01:56:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 305 transitions. [2019-01-14 01:56:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-14 01:56:50,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:50,994 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-14 01:56:50,995 INFO L423 AbstractCegarLoop]: === Iteration 26 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:50,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:50,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1353465532, now seen corresponding path program 16 times [2019-01-14 01:56:50,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:50,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:50,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:50,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 01:56:51,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:51,991 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 01:56:52,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:56:52,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:56:52,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:52,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 904 refuted. 0 times theorem prover too weak. 1428 trivial. 0 not checked. [2019-01-14 01:56:52,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:52,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2019-01-14 01:56:52,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 01:56:52,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 01:56:52,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:56:52,490 INFO L87 Difference]: Start difference. First operand 287 states and 305 transitions. Second operand 36 states. [2019-01-14 01:56:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:52,713 INFO L93 Difference]: Finished difference Result 341 states and 371 transitions. [2019-01-14 01:56:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-14 01:56:52,714 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 241 [2019-01-14 01:56:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:52,717 INFO L225 Difference]: With dead ends: 341 [2019-01-14 01:56:52,717 INFO L226 Difference]: Without dead ends: 300 [2019-01-14 01:56:52,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 225 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 01:56:52,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-14 01:56:52,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2019-01-14 01:56:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-01-14 01:56:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 312 transitions. [2019-01-14 01:56:52,727 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 312 transitions. Word has length 241 [2019-01-14 01:56:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:52,727 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 312 transitions. [2019-01-14 01:56:52,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 01:56:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 312 transitions. [2019-01-14 01:56:52,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-14 01:56:52,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:52,730 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 01:56:52,730 INFO L423 AbstractCegarLoop]: === Iteration 27 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:52,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:52,730 INFO L82 PathProgramCache]: Analyzing trace with hash -843307890, now seen corresponding path program 17 times [2019-01-14 01:56:52,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:52,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:52,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:52,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:52,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:53,705 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 01:56:53,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:53,705 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 01:56:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:56:53,797 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-01-14 01:56:53,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:53,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:54,243 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 01:56:54,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:54,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2019-01-14 01:56:54,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-14 01:56:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-14 01:56:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:56:54,263 INFO L87 Difference]: Start difference. First operand 294 states and 312 transitions. Second operand 38 states. [2019-01-14 01:56:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:54,571 INFO L93 Difference]: Finished difference Result 348 states and 378 transitions. [2019-01-14 01:56:54,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-14 01:56:54,573 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 253 [2019-01-14 01:56:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:54,576 INFO L225 Difference]: With dead ends: 348 [2019-01-14 01:56:54,576 INFO L226 Difference]: Without dead ends: 307 [2019-01-14 01:56:54,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 236 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 01:56:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-01-14 01:56:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2019-01-14 01:56:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-14 01:56:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 319 transitions. [2019-01-14 01:56:54,592 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 319 transitions. Word has length 253 [2019-01-14 01:56:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:54,596 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 319 transitions. [2019-01-14 01:56:54,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-14 01:56:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 319 transitions. [2019-01-14 01:56:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-14 01:56:54,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:54,598 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 01:56:54,601 INFO L423 AbstractCegarLoop]: === Iteration 28 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 349397047, now seen corresponding path program 18 times [2019-01-14 01:56:54,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:54,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:54,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:55,935 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 01:56:55,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:55,935 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 01:56:55,944 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 01:56:56,236 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-01-14 01:56:56,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:56:56,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:56:57,169 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 01:56:57,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:56:57,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-01-14 01:56:57,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-14 01:56:57,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-14 01:56:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 01:56:57,190 INFO L87 Difference]: Start difference. First operand 301 states and 319 transitions. Second operand 40 states. [2019-01-14 01:56:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:56:57,479 INFO L93 Difference]: Finished difference Result 355 states and 385 transitions. [2019-01-14 01:56:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-14 01:56:57,481 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 230 [2019-01-14 01:56:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:56:57,484 INFO L225 Difference]: With dead ends: 355 [2019-01-14 01:56:57,484 INFO L226 Difference]: Without dead ends: 314 [2019-01-14 01:56:57,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 212 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2019-01-14 01:56:57,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-14 01:56:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 308. [2019-01-14 01:56:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-01-14 01:56:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 326 transitions. [2019-01-14 01:56:57,497 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 326 transitions. Word has length 230 [2019-01-14 01:56:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:56:57,498 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 326 transitions. [2019-01-14 01:56:57,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-14 01:56:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 326 transitions. [2019-01-14 01:56:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-01-14 01:56:57,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:56:57,503 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-14 01:56:57,503 INFO L423 AbstractCegarLoop]: === Iteration 29 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:56:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:56:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash -204980914, now seen corresponding path program 19 times [2019-01-14 01:56:57,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:56:57,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:56:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:57,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:56:57,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:56:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-14 01:56:58,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:56:58,689 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 01:56:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:56:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:56:58,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3082 backedges. 0 proven. 1273 refuted. 0 times theorem prover too weak. 1809 trivial. 0 not checked. [2019-01-14 01:57:00,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:00,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2019-01-14 01:57:00,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-14 01:57:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-14 01:57:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 01:57:00,366 INFO L87 Difference]: Start difference. First operand 308 states and 326 transitions. Second operand 42 states. [2019-01-14 01:57:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:00,585 INFO L93 Difference]: Finished difference Result 362 states and 392 transitions. [2019-01-14 01:57:00,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 01:57:00,586 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 277 [2019-01-14 01:57:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:00,590 INFO L225 Difference]: With dead ends: 362 [2019-01-14 01:57:00,591 INFO L226 Difference]: Without dead ends: 321 [2019-01-14 01:57:00,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 258 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 01:57:00,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-01-14 01:57:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2019-01-14 01:57:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-14 01:57:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 333 transitions. [2019-01-14 01:57:00,603 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 333 transitions. Word has length 277 [2019-01-14 01:57:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:00,604 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 333 transitions. [2019-01-14 01:57:00,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-14 01:57:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 333 transitions. [2019-01-14 01:57:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-01-14 01:57:00,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:00,609 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 01:57:00,610 INFO L423 AbstractCegarLoop]: === Iteration 30 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2063192260, now seen corresponding path program 20 times [2019-01-14 01:57:00,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:00,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:00,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:57:00,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:01,399 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 01:57:01,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:01,399 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 01:57:01,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:57:01,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:57:01,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:57:01,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:02,149 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 01:57:02,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:02,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2019-01-14 01:57:02,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-14 01:57:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-14 01:57:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:57:02,171 INFO L87 Difference]: Start difference. First operand 315 states and 333 transitions. Second operand 44 states. [2019-01-14 01:57:02,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:02,470 INFO L93 Difference]: Finished difference Result 369 states and 399 transitions. [2019-01-14 01:57:02,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-14 01:57:02,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 289 [2019-01-14 01:57:02,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:02,474 INFO L225 Difference]: With dead ends: 369 [2019-01-14 01:57:02,474 INFO L226 Difference]: Without dead ends: 328 [2019-01-14 01:57:02,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 269 SyntacticMatches, 20 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2019-01-14 01:57:02,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-14 01:57:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2019-01-14 01:57:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-14 01:57:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 340 transitions. [2019-01-14 01:57:02,483 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 340 transitions. Word has length 289 [2019-01-14 01:57:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:02,484 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 340 transitions. [2019-01-14 01:57:02,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-14 01:57:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 340 transitions. [2019-01-14 01:57:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-14 01:57:02,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:02,486 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-14 01:57:02,487 INFO L423 AbstractCegarLoop]: === Iteration 31 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1826765367, now seen corresponding path program 21 times [2019-01-14 01:57:02,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:02,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:57:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-14 01:57:03,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:03,909 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 01:57:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 01:57:03,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-14 01:57:03,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:57:04,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:05,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 1554 refuted. 0 times theorem prover too weak. 1199 trivial. 0 not checked. [2019-01-14 01:57:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2019-01-14 01:57:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-14 01:57:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-14 01:57:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:57:05,054 INFO L87 Difference]: Start difference. First operand 322 states and 340 transitions. Second operand 46 states. [2019-01-14 01:57:05,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:05,480 INFO L93 Difference]: Finished difference Result 376 states and 406 transitions. [2019-01-14 01:57:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-14 01:57:05,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 266 [2019-01-14 01:57:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:05,485 INFO L225 Difference]: With dead ends: 376 [2019-01-14 01:57:05,485 INFO L226 Difference]: Without dead ends: 335 [2019-01-14 01:57:05,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 245 SyntacticMatches, 21 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 01:57:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-14 01:57:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 329. [2019-01-14 01:57:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-14 01:57:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 347 transitions. [2019-01-14 01:57:05,496 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 347 transitions. Word has length 266 [2019-01-14 01:57:05,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:05,498 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 347 transitions. [2019-01-14 01:57:05,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-14 01:57:05,498 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 347 transitions. [2019-01-14 01:57:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-01-14 01:57:05,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:05,503 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 01:57:05,504 INFO L423 AbstractCegarLoop]: === Iteration 32 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:05,504 INFO L82 PathProgramCache]: Analyzing trace with hash 338825084, now seen corresponding path program 22 times [2019-01-14 01:57:05,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:05,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:05,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:57:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:06,438 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 01:57:06,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:06,439 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 01:57:06,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 01:57:06,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 01:57:06,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:57:06,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:57:07,354 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 01:57:07,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:57:07,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2019-01-14 01:57:07,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-14 01:57:07,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-14 01:57:07,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 01:57:07,375 INFO L87 Difference]: Start difference. First operand 329 states and 347 transitions. Second operand 48 states. [2019-01-14 01:57:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:57:07,601 INFO L93 Difference]: Finished difference Result 383 states and 413 transitions. [2019-01-14 01:57:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-14 01:57:07,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 313 [2019-01-14 01:57:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:57:07,605 INFO L225 Difference]: With dead ends: 383 [2019-01-14 01:57:07,606 INFO L226 Difference]: Without dead ends: 342 [2019-01-14 01:57:07,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 291 SyntacticMatches, 22 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2019-01-14 01:57:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-14 01:57:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-01-14 01:57:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-14 01:57:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 354 transitions. [2019-01-14 01:57:07,620 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 354 transitions. Word has length 313 [2019-01-14 01:57:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:57:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 354 transitions. [2019-01-14 01:57:07,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-14 01:57:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 354 transitions. [2019-01-14 01:57:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-14 01:57:07,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:57:07,628 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 24, 24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-14 01:57:07,628 INFO L423 AbstractCegarLoop]: === Iteration 33 === [hanoiErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, hanoiErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:57:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:57:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash 486252238, now seen corresponding path program 23 times [2019-01-14 01:57:07,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:57:07,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:57:07,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:07,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:57:07,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:57:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:57:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 2003 proven. 936 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2019-01-14 01:57:09,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:57:09,434 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 01:57:09,443 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 01:57:09,543 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-01-14 01:57:09,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:57:09,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:59:41,030 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:00:17,854 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:01:06,328 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:01:37,951 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-14 02:01:38,152 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:01:38,153 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-14 02:01:38,165 INFO L168 Benchmark]: Toolchain (without parser) took 309725.42 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -387.7 MB). Peak memory consumption was 106.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:01:38,166 INFO L168 Benchmark]: CDTParser took 0.18 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 02:01:38,167 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:01:38,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:01:38,170 INFO L168 Benchmark]: Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:01:38,170 INFO L168 Benchmark]: RCFGBuilder took 387.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:01:38,171 INFO L168 Benchmark]: TraceAbstraction took 308987.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.4 MB). Peak memory consumption was 134.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:01:38,177 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.18 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 284.65 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.99 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -187.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 308987.72 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 346.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.4 MB). Peak memory consumption was 134.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...