java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:58:56,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:56,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:56,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:56,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:56,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:56,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:56,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:56,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:56,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:56,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:56,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:56,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:56,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:56,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:56,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:56,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:56,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:56,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:56,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:56,475 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:56,476 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:56,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:56,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:56,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:56,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:56,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:56,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:56,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:56,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:56,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:56,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:56,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:56,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:56,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:56,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:56,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:56,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:56,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:56,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:56,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:56,500 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:58:56,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:56,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:56,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:56,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:56,519 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:56,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:56,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:56,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:56,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:56,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:56,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:56,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:56,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:56,521 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:56,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:56,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:56,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:56,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:56,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:56,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:56,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:56,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:56,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:56,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:56,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:56,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:56,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:56,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:56,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:58:56,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:56,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:56,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:56,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:56,816 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:56,817 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2019-10-13 22:58:56,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1138abd6/e6b99da2e7d64ea8817e1f23e3ac52bd/FLAG5f61696ea [2019-10-13 22:58:57,320 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:57,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2019-10-13 22:58:57,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1138abd6/e6b99da2e7d64ea8817e1f23e3ac52bd/FLAG5f61696ea [2019-10-13 22:58:57,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1138abd6/e6b99da2e7d64ea8817e1f23e3ac52bd [2019-10-13 22:58:57,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:57,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:57,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:57,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:57,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:57,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57de3c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57, skipping insertion in model container [2019-10-13 22:58:57,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:57,745 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:57,762 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:57,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:57,947 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:57,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:57,977 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:57,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57 WrapperNode [2019-10-13 22:58:57,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:57,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:57,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:57,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:58,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (1/1) ... [2019-10-13 22:58:58,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:58,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:58,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:58,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:58,112 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (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-10-13 22:58:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:58:58,161 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:58,162 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:58,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:58,485 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:58,485 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 22:58:58,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:58 BoogieIcfgContainer [2019-10-13 22:58:58,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:58,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:58,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:58,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:58,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:57" (1/3) ... [2019-10-13 22:58:58,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171ce781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:58, skipping insertion in model container [2019-10-13 22:58:58,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:57" (2/3) ... [2019-10-13 22:58:58,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171ce781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:58, skipping insertion in model container [2019-10-13 22:58:58,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:58" (3/3) ... [2019-10-13 22:58:58,495 INFO L109 eAbstractionObserver]: Analyzing ICFG nested9.i [2019-10-13 22:58:58,510 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:58,521 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:58:58,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:58:58,558 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:58,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:58,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:58,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:58,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:58,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:58,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:58,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-13 22:58:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:58,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:58,584 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:58,586 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -528574952, now seen corresponding path program 1 times [2019-10-13 22:58:58,597 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:58,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750289365] [2019-10-13 22:58:58,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:58,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:58,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750289365] [2019-10-13 22:58:58,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:58,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 22:58:58,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701470281] [2019-10-13 22:58:58,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:58:58,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:58:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 22:58:58,924 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 8 states. [2019-10-13 22:58:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,185 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2019-10-13 22:58:59,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 22:58:59,188 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-10-13 22:58:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,197 INFO L225 Difference]: With dead ends: 53 [2019-10-13 22:58:59,197 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 22:58:59,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 22:58:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 22:58:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 22:58:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 22:58:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 22:58:59,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2019-10-13 22:58:59,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,247 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 22:58:59,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:58:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 22:58:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:59,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,249 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:59,249 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash -770191902, now seen corresponding path program 1 times [2019-10-13 22:58:59,250 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:59,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514747544] [2019-10-13 22:58:59,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:59,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:59,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514747544] [2019-10-13 22:58:59,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664776402] [2019-10-13 22:58:59,363 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:59,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 22:58:59,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:59,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:58:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:59,552 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:59,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 22:58:59,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2019-10-13 22:58:59,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454895444] [2019-10-13 22:58:59,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 22:58:59,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 22:58:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-10-13 22:58:59,655 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 8 states. [2019-10-13 22:58:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:59,777 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2019-10-13 22:58:59,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 22:58:59,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-10-13 22:58:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:59,780 INFO L225 Difference]: With dead ends: 39 [2019-10-13 22:58:59,780 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 22:58:59,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-10-13 22:58:59,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 22:58:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-10-13 22:58:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:58:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-13 22:58:59,793 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 18 [2019-10-13 22:58:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:59,794 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-13 22:58:59,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 22:58:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-13 22:58:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:58:59,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:59,796 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:59,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:59,998 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:59,999 INFO L82 PathProgramCache]: Analyzing trace with hash -14228257, now seen corresponding path program 1 times [2019-10-13 22:58:59,999 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:00,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356492034] [2019-10-13 22:59:00,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:00,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:00,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:00,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356492034] [2019-10-13 22:59:00,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137441685] [2019-10-13 22:59:00,169 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-10-13 22:59:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:00,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:00,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:00,362 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:00,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:00,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [585678369] [2019-10-13 22:59:00,508 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 22:59:00,508 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:00,523 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:00,535 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:00,536 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:00,667 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-13 22:59:01,676 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 13 for LOIs [2019-10-13 22:59:01,720 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-13 22:59:01,724 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:01,724 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:01,724 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 199#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:01,725 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 167#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~k~0 2) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~m~0 1000000) (<= main_~i~0 1) (= ~__BLAST_NONDET~0 0) (<= main_~j~0 2) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:01,725 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 148#(and (or (and (<= 0 main_~i~0) (= main_~i~0 1) (< main_~k~0 main_~j~0) (<= main_~i~0 1) (= ~__BLAST_NONDET~0 0)) (and (<= 0 main_~i~0) (< main_~k~0 main_~j~0) (<= main_~i~0 1) (= ~__BLAST_NONDET~0 0) (= main_~i~0 0))) (or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~k~0 2) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~i~0 0) (<= main_~m~0 1000000) (<= main_~j~0 2) (<= 0 (+ main_~m~0 1000000))) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~k~0 2) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= 1 main_~i~0) (<= main_~m~0 1000000) (<= main_~j~0 2) (<= 0 (+ main_~m~0 1000000))))) [2019-10-13 22:59:01,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 208#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) [2019-10-13 22:59:01,726 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 204#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:01,726 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 184#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 22:59:01,726 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 38#(and (<= 0 (+ main_~l~0 2147483648)) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:01,727 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:01,727 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:01,727 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 213#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:01,727 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 175#(and (or (and (<= 0 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (<= 0 (+ main_~n~0 1000000)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~i~0 0) (<= 0 (+ main_~m~0 1000000))) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (<= main_~i~0 1) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~j~0 0) (<= 0 (+ main_~m~0 1000000)))) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:01,728 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 43#(and (<= 0 (+ main_~l~0 2147483648)) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~n~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:01,728 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:01,728 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= 0 (+ main_~l~0 2147483648)) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:01,729 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 83#(and (<= main_~i~0 1) (<= main_~j~0 2) (or (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 2 main_~j~0) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~l~0 1000000)) (< 0 main_~n~0) (<= 0 ~__BLAST_NONDET~0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (= (* main_~i~0 2) main_~j~0) (<= 1 main_~i~0) (< main_~n~0 1000000) (< main_~i~0 main_~n~0) (< 0 (+ main_~l~0 1000000)) (<= 0 (+ main_~m~0 999997)) (= ~__BLAST_NONDET~0 0) (<= 1 main_~n~0) (< 0 (+ main_~m~0 1000000)) (< main_~l~0 1000000) (<= 0 (+ main_~l~0 2147483648)) (<= ~__BLAST_NONDET~0 0) (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0)) (<= 0 (+ main_~l~0 999997)) (< 0 (+ main_~n~0 1000000)) (= main_~i~0 1) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (<= 0 (+ main_~m~0 1000000))) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (= (* main_~i~0 2) main_~j~0) (< main_~n~0 1000000) (< main_~i~0 main_~n~0) (< 0 (+ main_~l~0 1000000)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (< main_~l~0 1000000) (<= 0 (+ main_~l~0 2147483648)) (<= ~__BLAST_NONDET~0 0) (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0)) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (<= 0 (+ main_~m~0 1000000)) (= main_~i~0 0)))) [2019-10-13 22:59:01,729 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 189#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:01,729 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 53#(and (< main_~l~0 1000000) (<= 0 (+ main_~l~0 2147483648)) (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (< 0 (+ main_~l~0 1000000)) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:01,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 179#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)))) [2019-10-13 22:59:01,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 194#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:01,730 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 143#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (or (and (= main_~i~0 1) (= ~__BLAST_NONDET~0 0)) (and (= ~__BLAST_NONDET~0 0) (= main_~i~0 0))) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~m~0 1000000) (<= main_~i~0 1) (<= main_~j~0 2) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:02,664 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 25 [2019-10-13 22:59:03,263 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:03,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 15] total 33 [2019-10-13 22:59:03,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179789783] [2019-10-13 22:59:03,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 22:59:03,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:03,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 22:59:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 22:59:03,267 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 33 states. [2019-10-13 22:59:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:05,406 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2019-10-13 22:59:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-13 22:59:05,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 25 [2019-10-13 22:59:05,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:05,412 INFO L225 Difference]: With dead ends: 77 [2019-10-13 22:59:05,412 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 22:59:05,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=665, Invalid=3117, Unknown=0, NotChecked=0, Total=3782 [2019-10-13 22:59:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 22:59:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-10-13 22:59:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 22:59:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-13 22:59:05,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 25 [2019-10-13 22:59:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:05,430 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-13 22:59:05,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 22:59:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-13 22:59:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 22:59:05,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:05,433 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:05,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:05,634 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1006291992, now seen corresponding path program 1 times [2019-10-13 22:59:05,636 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:05,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829821226] [2019-10-13 22:59:05,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:05,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 22:59:05,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829821226] [2019-10-13 22:59:05,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97960841] [2019-10-13 22:59:05,865 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-10-13 22:59:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:05,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:05,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 22:59:06,002 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 22:59:06,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1507080560] [2019-10-13 22:59:06,072 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 22:59:06,072 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:06,073 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:06,073 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:06,073 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:06,092 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-13 22:59:07,042 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2019-10-13 22:59:07,065 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-13 22:59:07,067 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:07,068 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:07,068 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 333#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:07,068 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 309#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0))) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~k~0 main_~j~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,069 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 296#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~k~0 main_~j~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,069 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 342#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) [2019-10-13 22:59:07,070 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 338#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:07,070 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 318#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 22:59:07,070 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 38#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:07,070 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:07,071 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:07,071 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 347#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:07,072 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 291#(or (and (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= 0 (+ main_~n~0 1000000)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~n~0 1000000) (< 0 (+ main_~l~0 1000000)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (< main_~l~0 1000000) (<= 0 (+ main_~l~0 2147483648)) (<= ~__BLAST_NONDET~0 0) (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0)) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (< main_~m~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (<= 0 (+ main_~m~0 1000000)) (= main_~i~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (<= main_~n~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000)))) [2019-10-13 22:59:07,072 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 43#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~n~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:07,072 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:07,073 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,073 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 278#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,074 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 323#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:07,077 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 53#(and (< main_~l~0 1000000) (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (< 0 (+ main_~l~0 1000000)) (<= 0 (+ main_~m~0 2147483648)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 313#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)))) [2019-10-13 22:59:07,078 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 328#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:07,079 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 247#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:07,651 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-10-13 22:59:08,189 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:08,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7, 15] total 35 [2019-10-13 22:59:08,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393238288] [2019-10-13 22:59:08,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 22:59:08,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 22:59:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 22:59:08,192 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 35 states. [2019-10-13 22:59:09,337 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 34 [2019-10-13 22:59:10,163 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-10-13 22:59:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:10,614 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2019-10-13 22:59:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 22:59:10,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-10-13 22:59:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:10,617 INFO L225 Difference]: With dead ends: 86 [2019-10-13 22:59:10,617 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 22:59:10,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=629, Invalid=2911, Unknown=0, NotChecked=0, Total=3540 [2019-10-13 22:59:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 22:59:10,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-13 22:59:10,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 22:59:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-13 22:59:10,643 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 38 [2019-10-13 22:59:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:10,643 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-13 22:59:10,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 22:59:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-13 22:59:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 22:59:10,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:10,645 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:10,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:10,850 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:10,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -236723464, now seen corresponding path program 2 times [2019-10-13 22:59:10,851 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:10,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198932150] [2019-10-13 22:59:10,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:10,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 22:59:10,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198932150] [2019-10-13 22:59:10,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773479290] [2019-10-13 22:59:10,974 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 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-10-13 22:59:11,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-13 22:59:11,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:11,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-13 22:59:11,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 43 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 22:59:11,129 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 22:59:11,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065037856] [2019-10-13 22:59:11,192 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-13 22:59:11,192 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:11,193 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:11,193 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:11,193 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:11,204 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 6 for LOIs [2019-10-13 22:59:12,221 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 11 for LOIs [2019-10-13 22:59:12,240 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 3 for LOIs [2019-10-13 22:59:12,242 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:12,242 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:12,242 INFO L193 IcfgInterpreter]: Reachable states at location L4-2 satisfy 482#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:12,242 INFO L193 IcfgInterpreter]: Reachable states at location L23-1 satisfy 458#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0))) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~k~0 main_~j~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,243 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 491#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) [2019-10-13 22:59:12,243 INFO L193 IcfgInterpreter]: Reachable states at location L23 satisfy 445#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~k~0 main_~j~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,243 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 487#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (not (= 0 __VERIFIER_assert_~cond)) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) [2019-10-13 22:59:12,243 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 467#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= ~__BLAST_NONDET~0 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= __VERIFIER_assert_~cond 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 22:59:12,244 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 38#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (<= 0 (+ main_~n~0 2147483648)) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~m~0 2147483647)) [2019-10-13 22:59:12,244 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:12,244 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:12,244 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 496#(and (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) [2019-10-13 22:59:12,244 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 440#(or (and (<= main_~l~0 2147483647) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= 0 (+ main_~n~0 1000000)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (< main_~n~0 1000000) (< 0 (+ main_~l~0 1000000)) (= ~__BLAST_NONDET~0 0) (< 0 (+ main_~m~0 1000000)) (< main_~l~0 1000000) (<= 0 (+ main_~l~0 2147483648)) (<= ~__BLAST_NONDET~0 0) (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0)) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (< main_~m~0 1000000) (<= main_~m~0 1000000) (<= 0 (+ main_~m~0 2147483648)) (<= 0 (+ main_~m~0 1000000)) (= main_~i~0 0)) (and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 1 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (<= (* 3 main_~i~0) (+ main_~j~0 3)) (<= main_~n~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000)))) [2019-10-13 22:59:12,245 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 43#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~n~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 2147483648))) [2019-10-13 22:59:12,245 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:12,245 INFO L193 IcfgInterpreter]: Reachable states at location L18 satisfy 48#(and (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 2147483648)) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,245 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 427#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,245 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 472#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:12,246 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 53#(and (< main_~l~0 1000000) (<= main_~l~0 2147483647) (<= 0 (+ main_~l~0 2147483648)) (<= main_~n~0 2147483647) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (< 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 1000000)) (<= 0 (+ main_~n~0 2147483648)) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= main_~m~0 2147483647) (< main_~m~0 1000000) (< main_~n~0 1000000) (<= main_~m~0 1000000) (< 0 (+ main_~l~0 1000000)) (= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~m~0 2147483648)) (< 0 (+ main_~m~0 1000000)) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,246 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 462#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0)))) [2019-10-13 22:59:12,246 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 477#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= ~__BLAST_NONDET~0 0) (<= 0 ~__BLAST_NONDET~0) (= ~__BLAST_NONDET~0 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:12,246 INFO L193 IcfgInterpreter]: Reachable states at location L22-2 satisfy 396#(and (<= 0 main_~j~0) (<= 0 main_~n~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= ~__BLAST_NONDET~0 0) (<= 0 (+ main_~l~0 1000000)) (<= 0 ~__BLAST_NONDET~0) (<= main_~m~0 1000000) (= ~__BLAST_NONDET~0 0) (<= main_~n~0 1000000) (<= main_~l~0 1000000) (<= 0 (+ main_~m~0 1000000))) [2019-10-13 22:59:12,725 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-10-13 22:59:13,198 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:13,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7, 15] total 33 [2019-10-13 22:59:13,198 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420895583] [2019-10-13 22:59:13,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-13 22:59:13,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:13,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-13 22:59:13,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 22:59:13,201 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 33 states. [2019-10-13 22:59:14,425 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-10-13 22:59:15,357 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2019-10-13 22:59:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:15,391 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2019-10-13 22:59:15,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 22:59:15,393 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 52 [2019-10-13 22:59:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:15,394 INFO L225 Difference]: With dead ends: 79 [2019-10-13 22:59:15,394 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:59:15,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=646, Invalid=2546, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 22:59:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:59:15,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:59:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:59:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:59:15,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2019-10-13 22:59:15,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:15,397 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:59:15,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-13 22:59:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:59:15,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:59:15,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:15,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:59:16,111 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-10-13 22:59:16,299 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 47 [2019-10-13 22:59:16,705 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-10-13 22:59:17,136 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-10-13 22:59:17,140 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) [2019-10-13 22:59:17,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:59:17,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:59:17,140 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ~__BLAST_NONDET~0 0) [2019-10-13 22:59:17,140 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:59:17,140 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 22:59:17,141 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2019-10-13 22:59:17,141 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (< main_~l~0 1000000)) (.cse4 (< main_~k~0 main_~j~0)) (.cse2 (< main_~n~0 1000000)) (.cse3 (< main_~m~0 1000000)) (.cse5 (< 0 (+ main_~l~0 1000000))) (.cse6 (< 0 (+ main_~m~0 1000000)))) (or (let ((.cse1 (* 2 main_~i~0))) (and .cse0 (<= 2 main_~i~0) (< main_~j~0 (* 3 main_~i~0)) (<= 0 main_~k~0) (<= (+ main_~j~0 3) (+ .cse1 main_~k~0 main_~n~0)) .cse2 .cse3 (< main_~i~0 main_~n~0) (<= .cse1 main_~j~0) .cse4 .cse5 .cse6)) (and (and .cse0 (<= (div (- main_~j~0) (- 2)) main_~k~0) .cse4 (= main_~i~0 1) (<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0))) (<= main_~k~0 main_~i~0)) .cse2 .cse3 .cse5 .cse6) (not (= 0 ~__BLAST_NONDET~0)))) [2019-10-13 22:59:17,141 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2019-10-13 22:59:17,141 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-13 22:59:17,141 INFO L446 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2019-10-13 22:59:17,142 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (< main_~l~0 1000000)) (.cse5 (<= main_~i~0 main_~n~0)) (.cse4 (< main_~n~0 1000000)) (.cse1 (< main_~m~0 1000000)) (.cse2 (< 0 (+ main_~l~0 1000000))) (.cse3 (< 0 (+ main_~m~0 1000000)))) (or (and .cse0 .cse1 (< 0 (+ main_~n~0 1000000)) (and (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0)) (= main_~i~0 0)) .cse2 .cse3) (and .cse4 .cse1 (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0))) .cse2 (<= (* 3 main_~i~0) (+ main_~j~0 3)) .cse3 (and (<= 2 main_~i~0) (<= 0 main_~k~0) (or (and .cse0 (< main_~j~0 (+ main_~k~0 2)) .cse5) (and .cse0 (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)))))) (and .cse0 .cse5 (<= 1 main_~i~0) .cse4 .cse1 (and (<= 0 main_~j~0) (<= main_~j~0 0)) .cse2 (<= main_~i~0 1) .cse3) (not (= 0 ~__BLAST_NONDET~0)))) [2019-10-13 22:59:17,142 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-10-13 22:59:17,142 INFO L439 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse10 (* 2 main_~i~0))) (let ((.cse4 (< main_~i~0 main_~n~0)) (.cse8 (<= (* 3 main_~n~0) (+ main_~l~0 main_~m~0))) (.cse9 (= .cse10 main_~j~0)) (.cse0 (< main_~l~0 1000000)) (.cse1 (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0)))) (.cse2 (< main_~n~0 1000000)) (.cse3 (< main_~m~0 1000000)) (.cse5 (<= .cse10 main_~j~0)) (.cse6 (< 0 (+ main_~l~0 1000000))) (.cse7 (< 0 (+ main_~m~0 1000000)))) (or (and .cse0 .cse1 (<= 1 main_~i~0) (< main_~j~0 (+ main_~k~0 2)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 (<= 0 main_~i~0) .cse8 (<= main_~i~0 0) .cse3 .cse4 .cse9) (and (and .cse0 .cse8 (= main_~i~0 1) .cse9) .cse3 (<= 2 main_~n~0)) (and .cse0 (<= 2 main_~i~0) (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (< main_~j~0 (* 3 main_~i~0)) (<= 0 main_~k~0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7) (not (= 0 ~__BLAST_NONDET~0))))) [2019-10-13 22:59:17,142 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-13 22:59:17,143 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2019-10-13 22:59:17,143 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2019-10-13 22:59:17,143 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (let ((.cse5 (* 2 main_~i~0))) (let ((.cse2 (<= (+ main_~j~0 3) (+ .cse5 main_~k~0 main_~n~0))) (.cse1 (* 3 main_~i~0)) (.cse0 (< main_~l~0 1000000)) (.cse8 (div (- main_~j~0) (- 2))) (.cse3 (< main_~n~0 1000000)) (.cse4 (< main_~m~0 1000000)) (.cse6 (< 0 (+ main_~l~0 1000000))) (.cse7 (< 0 (+ main_~m~0 1000000)))) (or (and .cse0 (<= 2 main_~i~0) (< main_~j~0 .cse1) (<= 0 main_~k~0) (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0))) .cse2 .cse3 .cse4 (< main_~i~0 main_~n~0) (<= .cse5 main_~j~0) .cse6 .cse7) (and .cse3 .cse4 .cse6 .cse7 (and .cse0 (<= .cse8 main_~k~0) .cse2 (< main_~k~0 main_~j~0) (<= main_~i~0 1)) (<= (+ main_~k~0 2) .cse1)) (and (< main_~i~0 main_~j~0) (and .cse0 (<= main_~k~0 2) (<= (+ .cse8 1) main_~k~0) (<= 1 main_~i~0) .cse3 .cse4 .cse6) (<= 2 main_~n~0) .cse7) (not (= 0 ~__BLAST_NONDET~0))))) [2019-10-13 22:59:17,143 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-10-13 22:59:17,143 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-13 22:59:17,144 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-13 22:59:17,144 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-13 22:59:17,144 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-13 22:59:17,144 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-13 22:59:17,144 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-13 22:59:17,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:59:17 BoogieIcfgContainer [2019-10-13 22:59:17,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 22:59:17,169 INFO L168 Benchmark]: Toolchain (without parser) took 19440.47 ms. Allocated memory was 138.9 MB in the beginning and 414.7 MB in the end (delta: 275.8 MB). Free memory was 102.8 MB in the beginning and 370.1 MB in the end (delta: -267.4 MB). Peak memory consumption was 273.5 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,170 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.43 ms. Allocated memory is still 138.9 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,172 INFO L168 Benchmark]: Boogie Preprocessor took 128.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.9 MB in the beginning and 181.3 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,172 INFO L168 Benchmark]: RCFGBuilder took 379.12 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 165.4 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,173 INFO L168 Benchmark]: TraceAbstraction took 18679.69 ms. Allocated memory was 202.9 MB in the beginning and 414.7 MB in the end (delta: 211.8 MB). Free memory was 164.7 MB in the beginning and 370.1 MB in the end (delta: -205.4 MB). Peak memory consumption was 271.5 MB. Max. memory is 7.1 GB. [2019-10-13 22:59:17,177 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 248.43 ms. Allocated memory is still 138.9 MB. Free memory was 102.5 MB in the beginning and 92.9 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.73 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.9 MB in the beginning and 181.3 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 379.12 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 165.4 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18679.69 ms. Allocated memory was 202.9 MB in the beginning and 414.7 MB in the end (delta: 211.8 MB). Free memory was 164.7 MB in the beginning and 370.1 MB in the end (delta: -205.4 MB). Peak memory consumption was 271.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((l < 1000000 && m < 1000000) && 0 < n + 1000000) && 3 * n <= l + m && i == 0) && 0 < l + 1000000) && 0 < m + 1000000) || ((((((n < 1000000 && m < 1000000) && k <= i + 2 * n) && 0 < l + 1000000) && 3 * i <= j + 3) && 0 < m + 1000000) && (2 <= i && 0 <= k) && (((l < 1000000 && j < k + 2) && i <= n) || (l < 1000000 && j + 1 <= i + n)))) || ((((((((l < 1000000 && i <= n) && 1 <= i) && n < 1000000) && m < 1000000) && 0 <= j && j <= 0) && 0 < l + 1000000) && i <= 1) && 0 < m + 1000000)) || !(0 == __BLAST_NONDET) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((((((((((((l < 1000000 && k <= i + 2 * n) && 1 <= i) && j < k + 2) && n < 1000000) && m < 1000000) && i < n) && 2 * i <= j) && 0 < l + 1000000) && 0 < m + 1000000) || ((((((l < 1000000 && 0 <= i) && 3 * n <= l + m) && i <= 0) && m < 1000000) && i < n) && 2 * i == j)) || (((((l < 1000000 && 3 * n <= l + m) && i == 1) && 2 * i == j) && m < 1000000) && 2 <= n)) || ((((((((((l < 1000000 && 2 <= i) && j + 1 <= i + n) && j < 3 * i) && 0 <= k) && k <= i + 2 * n) && n < 1000000) && m < 1000000) && 2 * i <= j) && 0 < l + 1000000) && 0 < m + 1000000)) || !(0 == __BLAST_NONDET) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((l < 1000000 && 2 <= i) && j < 3 * i) && 0 <= k) && k <= i + 2 * n) && j + 3 <= 2 * i + k + n) && n < 1000000) && m < 1000000) && i < n) && 2 * i <= j) && 0 < l + 1000000) && 0 < m + 1000000) || (((((n < 1000000 && m < 1000000) && 0 < l + 1000000) && 0 < m + 1000000) && (((l < 1000000 && -j / -2 <= k) && j + 3 <= 2 * i + k + n) && k < j) && i <= 1) && k + 2 <= 3 * i)) || (((i < j && (((((l < 1000000 && k <= 2) && -j / -2 + 1 <= k) && 1 <= i) && n < 1000000) && m < 1000000) && 0 < l + 1000000) && 2 <= n) && 0 < m + 1000000)) || !(0 == __BLAST_NONDET) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 18.5s, OverallIterations: 5, TraceHistogramMax: 5, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, HoareTripleCheckerStatistics: 72 SDtfs, 363 SDslu, 419 SDs, 0 SdLazy, 1324 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 510 GetRequests, 307 SyntacticMatches, 4 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 30 PreInvPairs, 62 NumberOfFragments, 552 HoareAnnotationTreeSize, 30 FomulaSimplifications, 2215 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 2173 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 282 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 402 ConstructedInterpolants, 0 QuantifiedInterpolants, 40961 SizeOfPredicates, 15 NumberOfNonLiveVariables, 272 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 13 InterpolantComputations, 2 PerfectInterpolantSequences, 283/375 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 3285, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 247, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 151, TOOLS_POST_TIME[ms]: 105, TOOLS_POST_CALL_APPLICATIONS: 43, TOOLS_POST_CALL_TIME[ms]: 486, TOOLS_POST_RETURN_APPLICATIONS: 34, TOOLS_POST_RETURN_TIME[ms]: 34, TOOLS_QUANTIFIERELIM_APPLICATIONS: 228, TOOLS_QUANTIFIERELIM_TIME[ms]: 561, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 55, FLUID_QUERY_TIME[ms]: 13, FLUID_QUERIES: 284, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 156, DOMAIN_JOIN_TIME[ms]: 2046, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 20, DOMAIN_WIDEN_TIME[ms]: 308, DOMAIN_ISSUBSETEQ_APPLICATIONS: 37, DOMAIN_ISSUBSETEQ_TIME[ms]: 83, DOMAIN_ISBOTTOM_APPLICATIONS: 34, DOMAIN_ISBOTTOM_TIME[ms]: 54, LOOP_SUMMARIZER_APPLICATIONS: 17, LOOP_SUMMARIZER_CACHE_MISSES: 17, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 2116, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 2116, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 37, CALL_SUMMARIZER_APPLICATIONS: 34, CALL_SUMMARIZER_CACHE_MISSES: 6, CALL_SUMMARIZER_OVERALL_TIME[ms]: 35, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 35, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 29, DAG_COMPRESSION_PROCESSED_NODES: 494, DAG_COMPRESSION_RETAINED_NODES: 209, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...