./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/genady.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-crafted-lit/genady.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 6938b5c805400363799492c040263d9022406929 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:24:56,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:24:56,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:24:56,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:24:56,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:24:56,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:24:56,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:24:56,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:24:56,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:24:56,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:24:56,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:24:56,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:24:56,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:24:56,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:24:56,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:24:56,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:24:56,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:24:56,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:24:56,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:24:56,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:24:56,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:24:56,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:24:56,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:24:56,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:24:56,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:24:56,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:24:56,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:24:56,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:24:56,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:24:56,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:24:56,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:24:56,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:24:56,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:24:56,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:24:56,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:24:56,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:24:56,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:24:56,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:24:56,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:24:56,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:24:56,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:24:56,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-11-28 20:24:56,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:24:56,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:24:56,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:24:56,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:24:56,789 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:24:56,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:24:56,790 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:24:56,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:24:56,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:24:56,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 20:24:56,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:24:56,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 20:24:56,791 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2019-11-28 20:24:56,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:24:56,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:24:56,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 20:24:56,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:24:56,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:24:56,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:24:56,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:24:56,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:24:56,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:24:56,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:24:56,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 20:24:56,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:24:56,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:24:56,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 20:24:56,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:24:56,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6938b5c805400363799492c040263d9022406929 [2019-11-28 20:24:57,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:24:57,112 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:24:57,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:24:57,117 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:24:57,117 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:24:57,119 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-28 20:24:57,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a891bf4/00187d644e0748558a2bf71286ba963c/FLAG37e84ab8e [2019-11-28 20:24:57,610 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:24:57,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/genady.c [2019-11-28 20:24:57,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a891bf4/00187d644e0748558a2bf71286ba963c/FLAG37e84ab8e [2019-11-28 20:24:58,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a891bf4/00187d644e0748558a2bf71286ba963c [2019-11-28 20:24:58,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:24:58,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:24:58,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:24:58,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:24:58,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:24:58,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3bfcda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58, skipping insertion in model container [2019-11-28 20:24:58,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:24:58,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:24:58,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:24:58,281 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:24:58,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:24:58,327 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:24:58,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58 WrapperNode [2019-11-28 20:24:58,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:24:58,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:24:58,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:24:58,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:24:58,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:24:58,367 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:24:58,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:24:58,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:24:58,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (1/1) ... [2019-11-28 20:24:58,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:24:58,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:24:58,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:24:58,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:24:58,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (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-11-28 20:24:58,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:24:58,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:24:58,738 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:24:58,739 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:24:58,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:58 BoogieIcfgContainer [2019-11-28 20:24:58,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:24:58,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:24:58,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:24:58,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:24:58,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:24:58" (1/3) ... [2019-11-28 20:24:58,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afcbabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:24:58, skipping insertion in model container [2019-11-28 20:24:58,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:58" (2/3) ... [2019-11-28 20:24:58,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4afcbabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:24:58, skipping insertion in model container [2019-11-28 20:24:58,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:58" (3/3) ... [2019-11-28 20:24:58,749 INFO L109 eAbstractionObserver]: Analyzing ICFG genady.c [2019-11-28 20:24:58,760 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:24:58,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-28 20:24:58,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 20:24:58,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:24:58,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 20:24:58,811 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:24:58,811 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:24:58,811 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:24:58,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:24:58,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:24:58,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:24:58,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 20:24:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-11-28 20:24:58,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:58,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-11-28 20:24:58,842 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:58,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2019-11-28 20:24:58,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:58,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743995293] [2019-11-28 20:24:58,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743995293] [2019-11-28 20:24:59,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127948180] [2019-11-28 20:24:59,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,093 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-11-28 20:24:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,161 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-11-28 20:24:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-11-28 20:24:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,170 INFO L225 Difference]: With dead ends: 22 [2019-11-28 20:24:59,170 INFO L226 Difference]: Without dead ends: 13 [2019-11-28 20:24:59,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-11-28 20:24:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-28 20:24:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 20:24:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-11-28 20:24:59,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 2 [2019-11-28 20:24:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,207 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-11-28 20:24:59,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-11-28 20:24:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 20:24:59,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 20:24:59,208 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash 30977, now seen corresponding path program 1 times [2019-11-28 20:24:59,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298795726] [2019-11-28 20:24:59,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298795726] [2019-11-28 20:24:59,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402548481] [2019-11-28 20:24:59,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,231 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-11-28 20:24:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,277 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-11-28 20:24:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 20:24:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,279 INFO L225 Difference]: With dead ends: 21 [2019-11-28 20:24:59,279 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 20:24:59,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 20:24:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-28 20:24:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:24:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-28 20:24:59,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-11-28 20:24:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,286 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-28 20:24:59,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-28 20:24:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 20:24:59,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 20:24:59,287 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash 29770307, now seen corresponding path program 1 times [2019-11-28 20:24:59,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952474496] [2019-11-28 20:24:59,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952474496] [2019-11-28 20:24:59,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241646253] [2019-11-28 20:24:59,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,309 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-28 20:24:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,335 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-11-28 20:24:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 20:24:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,336 INFO L225 Difference]: With dead ends: 19 [2019-11-28 20:24:59,337 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 20:24:59,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 20:24:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-28 20:24:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 20:24:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-11-28 20:24:59,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2019-11-28 20:24:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,343 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-11-28 20:24:59,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-11-28 20:24:59,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-28 20:24:59,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-28 20:24:59,345 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash 922879565, now seen corresponding path program 1 times [2019-11-28 20:24:59,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081651624] [2019-11-28 20:24:59,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081651624] [2019-11-28 20:24:59,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670608491] [2019-11-28 20:24:59,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,370 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-11-28 20:24:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,388 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-11-28 20:24:59,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-28 20:24:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,390 INFO L225 Difference]: With dead ends: 17 [2019-11-28 20:24:59,390 INFO L226 Difference]: Without dead ends: 16 [2019-11-28 20:24:59,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-28 20:24:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 20:24:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 20:24:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-28 20:24:59,396 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2019-11-28 20:24:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,396 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-28 20:24:59,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-28 20:24:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:24:59,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:24:59,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1455504507, now seen corresponding path program 1 times [2019-11-28 20:24:59,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014917196] [2019-11-28 20:24:59,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014917196] [2019-11-28 20:24:59,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913571313] [2019-11-28 20:24:59,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,446 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-11-28 20:24:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,470 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-11-28 20:24:59,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 20:24:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,473 INFO L225 Difference]: With dead ends: 16 [2019-11-28 20:24:59,473 INFO L226 Difference]: Without dead ends: 15 [2019-11-28 20:24:59,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-28 20:24:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-28 20:24:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 20:24:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-11-28 20:24:59,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2019-11-28 20:24:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,482 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-11-28 20:24:59,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-11-28 20:24:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 20:24:59,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:24:59,486 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2124000591, now seen corresponding path program 1 times [2019-11-28 20:24:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004512694] [2019-11-28 20:24:59,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004512694] [2019-11-28 20:24:59,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:24:59,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 20:24:59,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449588681] [2019-11-28 20:24:59,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 20:24:59,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 20:24:59,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,526 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-11-28 20:24:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,565 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-28 20:24:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 20:24:59,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 20:24:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,567 INFO L225 Difference]: With dead ends: 19 [2019-11-28 20:24:59,567 INFO L226 Difference]: Without dead ends: 18 [2019-11-28 20:24:59,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 20:24:59,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-28 20:24:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-28 20:24:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 20:24:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-11-28 20:24:59,572 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-11-28 20:24:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,573 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-11-28 20:24:59,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 20:24:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-11-28 20:24:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 20:24:59,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,574 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:24:59,574 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:24:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:24:59,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1055103537, now seen corresponding path program 1 times [2019-11-28 20:24:59,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:24:59,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159760218] [2019-11-28 20:24:59,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:24:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:24:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159760218] [2019-11-28 20:24:59,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294494563] [2019-11-28 20:24:59,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:24:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:24:59,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:24:59,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:24:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:24:59,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:24:59,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-28 20:24:59,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280987532] [2019-11-28 20:24:59,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:24:59,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:24:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:24:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:24:59,786 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-11-28 20:24:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:24:59,946 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 20:24:59,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:24:59,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-11-28 20:24:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:24:59,948 INFO L225 Difference]: With dead ends: 25 [2019-11-28 20:24:59,948 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 20:24:59,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:24:59,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 20:24:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-11-28 20:24:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 20:24:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-11-28 20:24:59,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-11-28 20:24:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:24:59,954 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-11-28 20:24:59,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:24:59,955 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-11-28 20:24:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:24:59,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:24:59,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 20:25:00,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,162 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 342218611, now seen corresponding path program 1 times [2019-11-28 20:25:00,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:00,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798038643] [2019-11-28 20:25:00,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798038643] [2019-11-28 20:25:00,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55636674] [2019-11-28 20:25:00,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:00,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:25:00,241 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:25:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:00,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:25:00,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 20:25:00,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712181026] [2019-11-28 20:25:00,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:25:00,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:25:00,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:25:00,248 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-11-28 20:25:00,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:00,291 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-11-28 20:25:00,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:25:00,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 20:25:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:00,292 INFO L225 Difference]: With dead ends: 24 [2019-11-28 20:25:00,293 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 20:25:00,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:25:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 20:25:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-28 20:25:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 20:25:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-11-28 20:25:00,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2019-11-28 20:25:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:00,299 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-11-28 20:25:00,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:25:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-11-28 20:25:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:25:00,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:25:00,300 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-11-28 20:25:00,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,505 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:00,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:00,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1217672673, now seen corresponding path program 1 times [2019-11-28 20:25:00,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:00,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682522858] [2019-11-28 20:25:00,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:00,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682522858] [2019-11-28 20:25:00,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876204535] [2019-11-28 20:25:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:00,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 20:25:00,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:25:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:00,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:25:00,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-11-28 20:25:00,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363347889] [2019-11-28 20:25:00,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:25:00,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:25:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:25:00,607 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-11-28 20:25:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:00,644 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 20:25:00,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:25:00,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 20:25:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:00,647 INFO L225 Difference]: With dead ends: 26 [2019-11-28 20:25:00,647 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:25:00,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:25:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:25:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 20:25:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:25:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 20:25:00,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2019-11-28 20:25:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:00,653 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 20:25:00,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:25:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 20:25:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:25:00,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:25:00,654 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-11-28 20:25:00,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,858 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333055, now seen corresponding path program 2 times [2019-11-28 20:25:00,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:00,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72224814] [2019-11-28 20:25:00,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:00,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72224814] [2019-11-28 20:25:00,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475169824] [2019-11-28 20:25:00,944 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:00,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:25:00,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:25:00,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:25:00,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:25:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:01,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:25:01,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-11-28 20:25:01,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524391770] [2019-11-28 20:25:01,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:25:01,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:01,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:25:01,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:25:01,077 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-11-28 20:25:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:01,333 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-28 20:25:01,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:25:01,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-11-28 20:25:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:01,335 INFO L225 Difference]: With dead ends: 32 [2019-11-28 20:25:01,335 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 20:25:01,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:25:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 20:25:01,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-11-28 20:25:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 20:25:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-28 20:25:01,350 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-11-28 20:25:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:01,350 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-28 20:25:01,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:25:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-28 20:25:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:25:01,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:25:01,355 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-11-28 20:25:01,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:01,556 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:01,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:01,556 INFO L82 PathProgramCache]: Analyzing trace with hash 708643907, now seen corresponding path program 2 times [2019-11-28 20:25:01,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:01,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278251043] [2019-11-28 20:25:01,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:25:01,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278251043] [2019-11-28 20:25:01,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306309000] [2019-11-28 20:25:01,637 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-11-28 20:25:01,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:25:01,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:25:01,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:25:01,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:01,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:25:01,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2019-11-28 20:25:01,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499547687] [2019-11-28 20:25:01,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:25:01,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:25:01,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:25:01,706 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2019-11-28 20:25:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:01,861 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 20:25:01,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:25:01,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 20:25:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:01,864 INFO L225 Difference]: With dead ends: 37 [2019-11-28 20:25:01,864 INFO L226 Difference]: Without dead ends: 36 [2019-11-28 20:25:01,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:25:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-28 20:25:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-28 20:25:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 20:25:01,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-11-28 20:25:01,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2019-11-28 20:25:01,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:01,869 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-11-28 20:25:01,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:25:01,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-11-28 20:25:01,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:25:01,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:25:01,871 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-11-28 20:25:02,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:02,080 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:02,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:02,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1446421327, now seen corresponding path program 2 times [2019-11-28 20:25:02,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:02,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533985721] [2019-11-28 20:25:02,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:25:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533985721] [2019-11-28 20:25:02,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123772266] [2019-11-28 20:25:02,168 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:02,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 20:25:02,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:25:02,192 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 20:25:02,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:25:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:02,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:25:02,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-11-28 20:25:02,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489265805] [2019-11-28 20:25:02,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:25:02,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:02,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:25:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:25:02,241 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2019-11-28 20:25:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:02,380 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-28 20:25:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:25:02,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 20:25:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:02,381 INFO L225 Difference]: With dead ends: 26 [2019-11-28 20:25:02,381 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 20:25:02,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:25:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 20:25:02,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 20:25:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 20:25:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-11-28 20:25:02,386 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-11-28 20:25:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:02,386 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-11-28 20:25:02,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:25:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-11-28 20:25:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:25:02,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:25:02,387 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-11-28 20:25:02,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:02,591 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-11-28 20:25:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:25:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1558507471, now seen corresponding path program 3 times [2019-11-28 20:25:02,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:25:02,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681242805] [2019-11-28 20:25:02,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:25:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:25:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:25:02,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681242805] [2019-11-28 20:25:02,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109563350] [2019-11-28 20:25:02,674 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:02,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 20:25:02,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 20:25:02,705 INFO L264 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 20:25:02,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:25:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 20:25:02,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 20:25:02,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2019-11-28 20:25:02,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63425944] [2019-11-28 20:25:02,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:25:02,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:25:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:25:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:25:02,755 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 5 states. [2019-11-28 20:25:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:25:02,784 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-11-28 20:25:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:25:02,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 20:25:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:25:02,789 INFO L225 Difference]: With dead ends: 25 [2019-11-28 20:25:02,790 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 20:25:02,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:25:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 20:25:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 20:25:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 20:25:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 20:25:02,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 20:25:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:25:02,792 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 20:25:02,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:25:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 20:25:02,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 20:25:02,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:25:03,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 20:25:03,114 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 20:25:03,114 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 20:25:03,115 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-28 20:25:03,115 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-28 20:25:03,115 INFO L242 CegarLoopResult]: At program point L19(lines 11 20) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)) [2019-11-28 20:25:03,116 INFO L246 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-28 20:25:03,116 INFO L246 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-11-28 20:25:03,116 INFO L246 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-11-28 20:25:03,116 INFO L246 CegarLoopResult]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L242 CegarLoopResult]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0))) (and (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 10001 .cse0) (<= .cse0 10001) (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)))) [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-11-28 20:25:03,117 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 20:25:03,118 INFO L246 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-28 20:25:03,118 INFO L246 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-11-28 20:25:03,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:25:03 BoogieIcfgContainer [2019-11-28 20:25:03,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:25:03,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:25:03,135 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:25:03,135 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:25:03,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:58" (3/4) ... [2019-11-28 20:25:03,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 20:25:03,148 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 20:25:03,149 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 20:25:03,189 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:25:03,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:25:03,192 INFO L168 Benchmark]: Toolchain (without parser) took 5184.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 952.3 MB in the beginning and 838.7 MB in the end (delta: 113.6 MB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:25:03,193 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:25:03,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:25:03,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.87 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:25:03,195 INFO L168 Benchmark]: Boogie Preprocessor took 126.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 941.6 MB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:25:03,196 INFO L168 Benchmark]: RCFGBuilder took 247.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:25:03,197 INFO L168 Benchmark]: TraceAbstraction took 4392.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.6 MB in the end (delta: 287.7 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:25:03,197 INFO L168 Benchmark]: Witness Printer took 55.02 ms. Allocated memory is still 1.2 GB. Free memory is still 838.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:25:03,201 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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 37.87 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 941.6 MB in the beginning and 1.2 GB in the end (delta: -209.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4392.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 845.6 MB in the end (delta: 287.7 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. * Witness Printer took 55.02 ms. Allocated memory is still 1.2 GB. Free memory is still 838.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((j <= i + 1 && 10001 <= i + j) && i + j <= 10001) && i <= j + 9999 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: i <= j + 9999 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. Result: SAFE, OverallTime: 4.1s, OverallIterations: 13, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 53 SDtfs, 145 SDslu, 21 SDs, 0 SdLazy, 393 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 25 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 26 HoareAnnotationTreeSize, 2 FomulaSimplifications, 71 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 269 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 15709 SizeOfPredicates, 1 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 64/174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...