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-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:33:50,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:33:50,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:33:50,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:33:50,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:33:50,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:33:50,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:33:50,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:33:50,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:33:50,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:33:50,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:33:50,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:33:50,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:33:50,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:33:50,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:33:50,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:33:50,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:33:50,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:33:50,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:33:50,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:33:50,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:33:50,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:33:50,477 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:33:50,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:33:50,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:33:50,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:33:50,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:33:50,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:33:50,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:33:50,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:33:50,486 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:33:50,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:33:50,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:33:50,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:33:50,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:33:50,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:33:50,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:33:50,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:33:50,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:33:50,495 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:33:50,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:33:50,497 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-07 13:33:50,533 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:33:50,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:33:50,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:33:50,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:33:50,538 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:33:50,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:33:50,538 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:33:50,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:33:50,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:33:50,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:33:50,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:33:50,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:33:50,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:33:50,539 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:33:50,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:33:50,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:33:50,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:33:50,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:33:50,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:33:50,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:33:50,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:33:50,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:33:50,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:33:50,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:33:50,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:33:50,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:33:50,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:33:50,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:33:50,543 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-07 13:33:50,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:33:50,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:33:50,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:33:50,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:33:50,870 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:33:50,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-10-07 13:33:50,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7fd02cd/521986b14c6e464a97176e1a2f328435/FLAGb6bc06975 [2019-10-07 13:33:51,431 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:33:51,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-10-07 13:33:51,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7fd02cd/521986b14c6e464a97176e1a2f328435/FLAGb6bc06975 [2019-10-07 13:33:51,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed7fd02cd/521986b14c6e464a97176e1a2f328435 [2019-10-07 13:33:51,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:33:51,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:33:51,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:33:51,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:33:51,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:33:51,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:33:51" (1/1) ... [2019-10-07 13:33:51,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089993a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:51, skipping insertion in model container [2019-10-07 13:33:51,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:33:51" (1/1) ... [2019-10-07 13:33:51,849 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:33:51,871 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:33:52,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:33:52,050 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:33:52,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:33:52,169 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:33:52,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52 WrapperNode [2019-10-07 13:33:52,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:33:52,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:33:52,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:33:52,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:33:52,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (1/1) ... [2019-10-07 13:33:52,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:33:52,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:33:52,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:33:52,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:33:52,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (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-07 13:33:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:33:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:33:52,272 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:33:52,273 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:33:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:33:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:33:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:33:52,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:33:52,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:33:52,577 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:33:52,578 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:33:52,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:52 BoogieIcfgContainer [2019-10-07 13:33:52,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:33:52,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:33:52,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:33:52,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:33:52,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:33:51" (1/3) ... [2019-10-07 13:33:52,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c12b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:52, skipping insertion in model container [2019-10-07 13:33:52,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:33:52" (2/3) ... [2019-10-07 13:33:52,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c12b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:33:52, skipping insertion in model container [2019-10-07 13:33:52,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:33:52" (3/3) ... [2019-10-07 13:33:52,587 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2019-10-07 13:33:52,596 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:33:52,604 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:33:52,614 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:33:52,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:33:52,640 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:33:52,640 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:33:52,640 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:33:52,640 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:33:52,640 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:33:52,640 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:33:52,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:33:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-07 13:33:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:33:52,661 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:52,661 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:52,663 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:52,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:52,668 INFO L82 PathProgramCache]: Analyzing trace with hash -859450362, now seen corresponding path program 1 times [2019-10-07 13:33:52,675 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:52,675 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:52,675 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:52,676 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:52,993 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-07 13:33:52,993 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:52,995 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:33:52,995 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:33:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:33:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:33:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:33:53,018 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-10-07 13:33:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:53,157 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-10-07 13:33:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:33:53,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-07 13:33:53,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:53,170 INFO L225 Difference]: With dead ends: 52 [2019-10-07 13:33:53,170 INFO L226 Difference]: Without dead ends: 29 [2019-10-07 13:33:53,174 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:33:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-07 13:33:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-10-07 13:33:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 13:33:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-07 13:33:53,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2019-10-07 13:33:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:53,220 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-07 13:33:53,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:33:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-07 13:33:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:33:53,222 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:53,222 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:53,223 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:53,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -884331265, now seen corresponding path program 1 times [2019-10-07 13:33:53,224 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:53,224 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:53,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:53,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:53,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:53,291 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-07 13:33:53,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:53,293 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:33:53,293 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:33:53,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:33:53,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:33:53,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:33:53,300 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-10-07 13:33:53,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:33:53,313 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-07 13:33:53,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:33:53,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:33:53,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:33:53,316 INFO L225 Difference]: With dead ends: 35 [2019-10-07 13:33:53,316 INFO L226 Difference]: Without dead ends: 25 [2019-10-07 13:33:53,317 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:33:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-07 13:33:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-07 13:33:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 13:33:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 13:33:53,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2019-10-07 13:33:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:33:53,325 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 13:33:53,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:33:53,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 13:33:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:33:53,327 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:33:53,327 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:33:53,327 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:33:53,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:33:53,328 INFO L82 PathProgramCache]: Analyzing trace with hash 689803461, now seen corresponding path program 1 times [2019-10-07 13:33:53,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:33:53,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:53,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:53,329 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:33:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:33:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:53,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:33:53,597 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:33:53,597 INFO L95 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-07 13:33:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:33:53,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:33:53,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:33:53,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:53,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:33:56,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:33:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:33:56,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:33:56,205 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 13:33:56,206 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:33:56,212 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:33:56,221 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:33:56,222 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:33:56,397 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 18 for LOIs [2019-10-07 13:33:56,829 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:56,862 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:56,990 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:57,032 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:57,138 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:33:57,141 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 16 for LOIs [2019-10-07 13:33:57,230 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:33:57,246 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:33:57,246 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:33:57,247 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 208#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 217#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:33:57,247 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 193#(and (or (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond))) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:33:57,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 203#(and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 213#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,248 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,249 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,249 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 222#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,250 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:33:57,250 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 183#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~loop_entered~0) (<= main_~loop_entered~0 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:57,251 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 188#(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 (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:33:57,252 INFO L193 IcfgInterpreter]: Reachable states at location L11-2 satisfy 198#(and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:33:57,252 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 147#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~loop_entered~0) (<= main_~loop_entered~0 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:57,252 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 131#(and (<= main_~loop_entered~0 1) (or (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 1 main_~loop_entered~0) (<= |main_~#array~0.offset| 0) (<= 0 main_~loop_entered~0) (= main_~loop_entered~0 1) (= |#NULL.offset| 0)) (and (< (mod main_~index2~0 4294967296) 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= 0 main_~loop_entered~0) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (< (mod main_~index1~0 4294967296) (mod main_~index2~0 4294967296)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (<= 0 main_~loop_entered~0) (= (store |old(#length)| |main_~#array~0.base| 400000) |#length|) (< (mod main_~index1~0 4294967296) 100000) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-07 13:33:57,742 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-10-07 13:33:58,040 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:33:58,040 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 10] total 24 [2019-10-07 13:33:58,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-07 13:33:58,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-07 13:33:58,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=477, Unknown=1, NotChecked=0, Total=552 [2019-10-07 13:33:58,044 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 24 states. [2019-10-07 13:33:58,312 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-07 13:34:04,219 WARN L191 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-10-07 13:34:21,900 WARN L191 SmtUtils]: Spent 15.09 s on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-10-07 13:34:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:32,956 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-10-07 13:34:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:34:32,957 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 17 [2019-10-07 13:34:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:32,958 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:34:32,959 INFO L226 Difference]: Without dead ends: 26 [2019-10-07 13:34:32,960 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=181, Invalid=939, Unknown=2, NotChecked=0, Total=1122 [2019-10-07 13:34:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-07 13:34:32,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-10-07 13:34:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-07 13:34:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-07 13:34:32,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-07 13:34:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:32,969 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-07 13:34:32,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-07 13:34:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-07 13:34:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:34:32,972 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:32,972 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:33,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:33,178 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1889908222, now seen corresponding path program 1 times [2019-10-07 13:34:33,179 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:33,179 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:33,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:33,179 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:33,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:33,868 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 73 [2019-10-07 13:34:36,292 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2019-10-07 13:34:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:36,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:36,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:34:36,369 INFO L95 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-07 13:34:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-07 13:34:36,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:34:43,119 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:43,128 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:43,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 13:34:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:43,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:34:43,671 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-07 13:34:44,330 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:45,503 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:45,526 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:45,928 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,501 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,666 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,675 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,741 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,761 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:46,803 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:48,560 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:48,581 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:48,601 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:48,617 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:48,644 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:50,840 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (+ (* 4 (mod (+ main_~index1~0 1) 4294967296)) |main_~#array~0.offset| (- 17179869184))) (select .cse0 (+ (* 4 (mod (+ main_~index2~0 4294967295) 4294967296)) |main_~#array~0.offset|)))) [2019-10-07 13:34:53,122 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,269 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,353 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,374 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,388 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,517 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,526 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,611 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:53,621 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:55,713 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (+ (* 4 (mod (+ main_~index1~0 1) 4294967296)) |main_~#array~0.offset| (- 17179869184))) (select .cse0 (+ (* 4 (mod (+ main_~index2~0 4294967295) 4294967296)) |main_~#array~0.offset|)))) [2019-10-07 13:34:55,750 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:55,866 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,055 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,063 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,072 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,261 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,271 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,307 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,498 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,696 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,706 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,756 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,780 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:56,798 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-07 13:34:57,084 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 19 [2019-10-07 13:34:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:58,279 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 13:34:58,280 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9] total 15 [2019-10-07 13:34:58,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:34:58,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:34:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=163, Unknown=4, NotChecked=0, Total=210 [2019-10-07 13:34:58,281 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-10-07 13:34:58,577 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-07 13:35:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:35:00,811 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-10-07 13:35:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:35:00,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-10-07 13:35:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:35:00,813 INFO L225 Difference]: With dead ends: 22 [2019-10-07 13:35:00,813 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:35:00,814 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=56, Invalid=246, Unknown=4, NotChecked=0, Total=306 [2019-10-07 13:35:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:35:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:35:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:35:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:35:00,815 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-07 13:35:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:35:00,815 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:35:00,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:35:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:35:00,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:35:01,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:35:01,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:35:01,931 WARN L191 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 92 [2019-10-07 13:35:04,288 WARN L191 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-10-07 13:35:05,038 WARN L191 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 94 [2019-10-07 13:35:05,336 WARN L191 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 73 [2019-10-07 13:35:05,339 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:35:05,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:35:05,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:35:05,339 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 13:35:05,339 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:35:05,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:35:05,340 INFO L439 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (let ((.cse9 (= |main_~#array~0.offset| 0)) (.cse1 (= 0 (select |#valid| 0))) (.cse2 (mod main_~index1~0 4294967296))) (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (let ((.cse0 (* 4294967296 (div (+ main_~index2~0 1) 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse0 99998)) .cse1 (let ((.cse3 (mod main_~index2~0 4294967296))) (or (<= .cse2 .cse3) (let ((.cse8 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse7 (select .cse8 (+ (* 4 .cse2) |main_~#array~0.offset|))) (.cse5 (select .cse8 (+ (* 4 .cse3) |main_~#array~0.offset|)))) (let ((.cse6 (+ .cse7 (* 4294967296 (div .cse5 4294967296)))) (.cse4 (* 4294967296 (div .cse7 4294967296)))) (and (<= (+ .cse4 .cse5) .cse6) (< .cse6 (+ .cse4 .cse5 1)))))))) (and .cse9 (= main_~loop_entered~0 1)))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and .cse9 (< main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 100000)) (= 0 main_~loop_entered~0) .cse1 (< .cse2 100000)))) [2019-10-07 13:35:05,340 INFO L443 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2019-10-07 13:35:05,340 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2019-10-07 13:35:05,340 INFO L439 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (let ((.cse2 (= 0 (select |#valid| 0))) (.cse1 (and (= |main_~#array~0.offset| 0) (= |#NULL.base| 0) (= main_~loop_entered~0 1)))) (or (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse0 99999)) (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))) (or (and (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 400000) |#length|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= 0 main_~loop_entered~0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1))) .cse1) .cse2 (<= 0 |main_~#array~0.offset|))) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (let ((.cse3 (* 4294967296 (div (+ main_~index2~0 1) 4294967296)))) (and (<= (+ .cse3 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse3 99998)) .cse2 (let ((.cse8 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse7 (select .cse8 (+ (* 4 (mod main_~index1~0 4294967296)) |main_~#array~0.offset|))) (.cse5 (select .cse8 (+ (* 4 (mod main_~index2~0 4294967296)) |main_~#array~0.offset|)))) (let ((.cse6 (+ .cse7 (* 4294967296 (div .cse5 4294967296)))) (.cse4 (* 4294967296 (div .cse7 4294967296)))) (and (<= (+ .cse4 .cse5) .cse6) (< .cse6 (+ .cse4 .cse5 1)))))) .cse1)) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)))) [2019-10-07 13:35:05,341 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (let ((.cse6 (= 0 main_~loop_entered~0)) (.cse5 (* 4294967296 (div main_~index2~0 4294967296)))) (let ((.cse1 (<= (+ .cse5 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))) (.cse2 (or (and (<= |main_~#array~0.offset| 0) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#array~0.base| 400000) |#length|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) .cse6 (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1))) (and (= |main_~#array~0.offset| 0) (= |#NULL.base| 0) (= main_~loop_entered~0 1)))) (.cse3 (= 0 (select |#valid| 0))) (.cse4 (<= 0 |main_~#array~0.offset|))) (or (let ((.cse0 (* 4294967296 (div (+ main_~index2~0 1) 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse0 99998)) .cse1 .cse2 .cse3 .cse4)) (and .cse1 .cse2 (< main_~index2~0 (+ .cse5 100000)) .cse3 .cse6 .cse4)))) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:35:05,341 INFO L443 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-10-07 13:35:05,341 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (<= |#NULL.base| 0))) [2019-10-07 13:35:05,341 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (let ((.cse0 (* 4294967296 (div (+ main_~index2~0 1) 4294967296))) (.cse3 (mod main_~index1~0 4294967296)) (.cse4 (mod main_~index2~0 4294967296)) (.cse2 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse1 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (< .cse1 (+ .cse2 |main_#t~mem8| 1)) (<= main_~index2~0 (+ .cse0 99998)) (= 0 (select |#valid| 0)) (or (<= .cse3 .cse4) (let ((.cse9 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse8 (select .cse9 (+ (* 4 .cse3) |main_~#array~0.offset|))) (.cse6 (select .cse9 (+ (* 4 .cse4) |main_~#array~0.offset|)))) (let ((.cse7 (+ .cse8 (* 4294967296 (div .cse6 4294967296)))) (.cse5 (* 4294967296 (div .cse8 4294967296)))) (and (<= (+ .cse5 .cse6) .cse7) (< .cse7 (+ .cse5 .cse6 1))))))) (or (and (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 400000) |#length|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= 0 main_~loop_entered~0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (< .cse3 .cse4)) (and (= |main_~#array~0.offset| 0) (= main_~loop_entered~0 1))) (<= 0 |main_~#array~0.offset|) (<= (+ .cse2 |main_#t~mem8|) .cse1)))) [2019-10-07 13:35:05,341 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-10-07 13:35:05,341 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2019-10-07 13:35:05,341 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-10-07 13:35:05,341 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-10-07 13:35:05,342 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2019-10-07 13:35:05,342 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-10-07 13:35:05,342 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2019-10-07 13:35:05,342 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-10-07 13:35:05,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,357 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,371 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:35:05,372 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,373 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,374 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,379 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,380 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,381 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,382 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,383 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,386 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:35:05 BoogieIcfgContainer [2019-10-07 13:35:05,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:35:05,392 INFO L168 Benchmark]: Toolchain (without parser) took 73559.41 ms. Allocated memory was 138.4 MB in the beginning and 296.7 MB in the end (delta: 158.3 MB). Free memory was 102.6 MB in the beginning and 256.1 MB in the end (delta: -153.6 MB). Peak memory consumption was 160.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,393 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.48 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.7 MB in the end (delta: -79.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,396 INFO L168 Benchmark]: Boogie Preprocessor took 45.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.7 MB in the beginning and 179.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,397 INFO L168 Benchmark]: RCFGBuilder took 363.21 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 163.4 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,397 INFO L168 Benchmark]: TraceAbstraction took 72809.03 ms. Allocated memory was 202.4 MB in the beginning and 296.7 MB in the end (delta: 94.4 MB). Free memory was 162.7 MB in the beginning and 256.1 MB in the end (delta: -93.4 MB). Peak memory consumption was 157.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:35:05,404 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 336.48 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 181.7 MB in the end (delta: -79.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.7 MB in the beginning and 179.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 363.21 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 163.4 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72809.03 ms. Allocated memory was 202.4 MB in the beginning and 296.7 MB in the end (delta: 94.4 MB). Free memory was 162.7 MB in the beginning and 256.1 MB in the end (delta: -93.4 MB). Peak memory consumption was 157.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 40]: Loop Invariant [2019-10-07 13:35:05,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:35:05,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,419 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:35:05,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:35:05,421 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((((index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) && ((((((array <= 0 && \old(unknown-#length-unknown)[array := 400000] == unknown-#length-unknown) && \old(\valid)[array] == 0) && array < unknown-#StackHeapBarrier-unknown) && 0 == loop_entered) && \valid == \old(\valid)[array := 1]) || ((array == 0 && #NULL == 0) && loop_entered == 1))) && 0 == \valid[0]) && 0 <= array) || !(#NULL <= 0)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || ((((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) && 0 == \valid[0]) && 4294967296 * (unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] / 4294967296) + unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] <= unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] + 4294967296 * (unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] / 4294967296) && unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] + 4294967296 * (unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] / 4294967296) + unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] + 1) && (array == 0 && #NULL == 0) && loop_entered == 1)) || !(0 <= #NULL)) || !(#NULL <= 0) - InvariantResult [Line: 31]: Loop Invariant [2019-10-07 13:35:05,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,425 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,426 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,427 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:35:05,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:35:05,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((!(#NULL <= 0) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || ((((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) && 0 == \valid[0]) && (index1 % 4294967296 <= index2 % 4294967296 || (4294967296 * (unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] / 4294967296) + unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] <= unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] + 4294967296 * (unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] / 4294967296) && unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] + 4294967296 * (unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[array][4 * (index1 % 4294967296) + array] / 4294967296) + unknown-#memory_int-unknown[array][4 * (index2 % 4294967296) + array] + 1))) && array == 0 && loop_entered == 1)) || !(0 <= #NULL)) || !(#NULL <= 0)) || ((((array == 0 && index2 < 4294967296 * (index2 / 4294967296) + 100000) && 0 == loop_entered) && 0 == \valid[0]) && index1 % 4294967296 < 100000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. Result: SAFE, OverallTime: 72.7s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 37.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, HoareTripleCheckerStatistics: 61 SDtfs, 85 SDslu, 144 SDs, 0 SdLazy, 231 SolverSat, 49 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=1, 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, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 982 HoareAnnotationTreeSize, 14 FomulaSimplifications, 55 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 1675 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 27.7s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 58544 SizeOfPredicates, 13 NumberOfNonLiveVariables, 140 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 16/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1047, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 37, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 17, TOOLS_POST_TIME[ms]: 69, TOOLS_POST_CALL_APPLICATIONS: 11, TOOLS_POST_CALL_TIME[ms]: 234, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME[ms]: 23, TOOLS_QUANTIFIERELIM_APPLICATIONS: 36, TOOLS_QUANTIFIERELIM_TIME[ms]: 292, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 58, FLUID_QUERY_TIME[ms]: 5, FLUID_QUERIES: 39, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME[ms]: 577, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 21, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 3, DOMAIN_ISBOTTOM_APPLICATIONS: 5, DOMAIN_ISBOTTOM_TIME[ms]: 20, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 461, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 458, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME[ms]: 64, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 64, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 8, PATH_EXPR_TIME[ms]: 4, REGEX_TO_DAG_TIME[ms]: 3, DAG_COMPRESSION_TIME[ms]: 17, DAG_COMPRESSION_PROCESSED_NODES: 84, DAG_COMPRESSION_RETAINED_NODES: 51, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...