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-acceleration/array_2-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:29:07,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:29:07,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:29:07,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:29:07,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:29:07,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:29:07,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:29:07,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:29:07,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:29:07,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:29:07,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:29:07,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:29:07,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:29:07,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:29:07,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:29:07,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:29:07,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:29:07,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:29:07,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:29:07,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:29:07,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:29:07,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:29:07,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:29:07,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:29:07,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:29:07,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:29:07,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:29:07,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:29:07,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:29:07,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:29:07,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:29:07,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:29:07,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:29:07,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:29:07,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:29:07,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:29:07,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:29:07,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:29:07,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:29:07,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:29:07,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:29:07,616 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:29:07,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:29:07,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:29:07,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:29:07,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:29:07,655 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:29:07,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:29:07,655 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:29:07,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:29:07,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:29:07,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:29:07,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:29:07,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:29:07,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:29:07,660 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:29:07,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:29:07,660 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:29:07,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:29:07,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:29:07,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:29:07,661 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:29:07,661 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:29:07,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:29:07,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:29:07,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:29:07,662 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:29:07,662 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:29:07,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:29:07,663 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:29:07,664 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:29:07,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:29:07,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:29:08,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:29:08,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:29:08,002 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:29:08,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-10-07 13:29:08,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae37f303/56293c0a7b594b61a151ab070d414f0e/FLAG6c7ed2209 [2019-10-07 13:29:08,527 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:29:08,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2.i [2019-10-07 13:29:08,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae37f303/56293c0a7b594b61a151ab070d414f0e/FLAG6c7ed2209 [2019-10-07 13:29:08,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae37f303/56293c0a7b594b61a151ab070d414f0e [2019-10-07 13:29:08,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:29:08,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:29:08,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:08,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:29:08,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:29:08,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:08" (1/1) ... [2019-10-07 13:29:08,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2aae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:08, skipping insertion in model container [2019-10-07 13:29:08,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:29:08" (1/1) ... [2019-10-07 13:29:08,944 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:29:08,966 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:29:09,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:09,153 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:29:09,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:29:09,206 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:29:09,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09 WrapperNode [2019-10-07 13:29:09,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:29:09,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:29:09,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:29:09,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:29:09,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (1/1) ... [2019-10-07 13:29:09,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:29:09,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:29:09,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:29:09,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:29:09,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (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:29:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:29:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:29:09,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:29:09,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:29:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:29:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:29:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:29:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:29:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:29:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:29:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:29:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:29:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:29:09,673 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:29:09,674 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:29:09,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:09 BoogieIcfgContainer [2019-10-07 13:29:09,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:29:09,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:29:09,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:29:09,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:29:09,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:29:08" (1/3) ... [2019-10-07 13:29:09,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf6e743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:09, skipping insertion in model container [2019-10-07 13:29:09,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:29:09" (2/3) ... [2019-10-07 13:29:09,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cf6e743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:29:09, skipping insertion in model container [2019-10-07 13:29:09,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:29:09" (3/3) ... [2019-10-07 13:29:09,691 INFO L109 eAbstractionObserver]: Analyzing ICFG array_2-2.i [2019-10-07 13:29:09,707 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:29:09,721 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:29:09,732 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:29:09,757 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:29:09,757 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:29:09,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:29:09,758 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:29:09,758 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:29:09,758 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:29:09,758 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:29:09,758 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:29:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-10-07 13:29:09,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:29:09,779 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:09,779 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:09,781 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1959451811, now seen corresponding path program 1 times [2019-10-07 13:29:09,793 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:09,793 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:09,793 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:09,793 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:09,952 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:29:09,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:09,953 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:29:09,953 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:29:09,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:29:09,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:29:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:29:09,976 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-10-07 13:29:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:10,021 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-07 13:29:10,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:29:10,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-07 13:29:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:10,030 INFO L225 Difference]: With dead ends: 29 [2019-10-07 13:29:10,030 INFO L226 Difference]: Without dead ends: 12 [2019-10-07 13:29:10,033 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:29:10,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-10-07 13:29:10,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-10-07 13:29:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-07 13:29:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-10-07 13:29:10,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-10-07 13:29:10,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:10,066 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-10-07 13:29:10,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:29:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-10-07 13:29:10,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:29:10,067 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:10,068 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:10,068 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:10,069 INFO L82 PathProgramCache]: Analyzing trace with hash 504932467, now seen corresponding path program 1 times [2019-10-07 13:29:10,069 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:10,070 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:10,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:10,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:10,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:10,149 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:10,150 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:29:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:10,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 13:29:10,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:10,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:10,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:10,316 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:10,344 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:10,344 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:10,354 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:10,363 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:10,365 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:10,538 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:11,059 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:29:11,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:11,081 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:11,082 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:11,082 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_1) 4096) (select (select |#memory_int| v_prenex_2) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:11,083 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:29:11,083 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:11,083 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:29:11,084 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:29:11,084 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:11,084 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:11,085 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_1) 4096) (select (select |#memory_int| v_prenex_2) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:11,085 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_1) 4096) (select (select |#memory_int| v_prenex_2) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:11,086 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((v_prenex_2 Int) (|v_main_~#A~0.base_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#B~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_1) 4096) (select (select |#memory_int| v_prenex_2) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_1|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_1|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:11,086 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:29:11,495 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:11,495 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 9] total 16 [2019-10-07 13:29:11,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 13:29:11,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 13:29:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:29:11,499 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-10-07 13:29:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:12,155 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-10-07 13:29:12,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-07 13:29:12,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-10-07 13:29:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:12,156 INFO L225 Difference]: With dead ends: 20 [2019-10-07 13:29:12,157 INFO L226 Difference]: Without dead ends: 15 [2019-10-07 13:29:12,158 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:29:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-07 13:29:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-07 13:29:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:29:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-10-07 13:29:12,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2019-10-07 13:29:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:12,164 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-10-07 13:29:12,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 13:29:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-10-07 13:29:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:29:12,165 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:12,165 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:12,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:12,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:12,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1070026915, now seen corresponding path program 2 times [2019-10-07 13:29:12,373 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:12,373 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:12,373 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:12,373 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:12,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:12,464 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:12,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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:29:12,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 13:29:12,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:12,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 13:29:12,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:12,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:12,602 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:12,604 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:12,604 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:12,605 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:12,605 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:12,605 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:12,661 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:12,970 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:29:12,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:12,995 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:12,995 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:12,995 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|) 4096)) (= |__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) (not (= (select (select |#memory_int| v_prenex_4) 4096) (select (select |#memory_int| v_prenex_3) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:12,996 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:29:12,996 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:12,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:29:12,997 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:29:12,998 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:12,999 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:12,999 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|) 4096)) (= |__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) (not (= (select (select |#memory_int| v_prenex_4) 4096) (select (select |#memory_int| v_prenex_3) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:13,000 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|) 4096)) (= |__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) (not (= (select (select |#memory_int| v_prenex_4) 4096) (select (select |#memory_int| v_prenex_3) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:13,000 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((v_prenex_4 Int) (v_prenex_3 Int) (|v_main_~#B~0.base_BEFORE_CALL_2| Int) (|v_main_~#A~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_2|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_2|) 4096)) (= |__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) (not (= (select (select |#memory_int| v_prenex_4) 4096) (select (select |#memory_int| v_prenex_3) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:13,000 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:29:13,398 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:13,398 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 22 [2019-10-07 13:29:13,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-07 13:29:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-07 13:29:13,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2019-10-07 13:29:13,401 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 22 states. [2019-10-07 13:29:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:14,149 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-10-07 13:29:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:29:14,150 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-10-07 13:29:14,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:14,151 INFO L225 Difference]: With dead ends: 26 [2019-10-07 13:29:14,151 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 13:29:14,152 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 13:29:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 13:29:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 13:29:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 13:29:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-10-07 13:29:14,158 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-10-07 13:29:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:14,159 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-10-07 13:29:14,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-07 13:29:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-10-07 13:29:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:29:14,160 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:14,160 INFO L385 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:14,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:14,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1928773981, now seen corresponding path program 3 times [2019-10-07 13:29:14,366 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:14,366 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:14,367 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:14,367 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:14,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:14,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:14,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:14,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:14,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-07 13:29:14,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:29:14,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:29:14,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:29:14,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:14,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:14,831 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:14,834 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:14,834 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:14,835 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:14,835 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:14,835 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:14,895 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:15,118 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:29:15,140 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:15,152 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:15,152 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:15,153 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_6) 4096) (select (select |#memory_int| v_prenex_5) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:15,153 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:29:15,154 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:15,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:29:15,155 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:29:15,155 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:15,156 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:15,159 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_6) 4096) (select (select |#memory_int| v_prenex_5) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:15,159 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_6) 4096) (select (select |#memory_int| v_prenex_5) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:15,160 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((v_prenex_6 Int) (v_prenex_5 Int) (|v_main_~#B~0.base_BEFORE_CALL_3| Int) (|v_main_~#A~0.base_BEFORE_CALL_3| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_prenex_6) 4096) (select (select |#memory_int| v_prenex_5) 4096)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_3|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_3|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:15,160 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:29:15,531 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:15,532 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 9] total 34 [2019-10-07 13:29:15,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-07 13:29:15,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-07 13:29:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=797, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 13:29:15,534 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 34 states. [2019-10-07 13:29:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:16,951 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2019-10-07 13:29:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-07 13:29:16,951 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 20 [2019-10-07 13:29:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:16,952 INFO L225 Difference]: With dead ends: 38 [2019-10-07 13:29:16,953 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:29:16,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=966, Invalid=2816, Unknown=0, NotChecked=0, Total=3782 [2019-10-07 13:29:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:29:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-07 13:29:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:29:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-10-07 13:29:16,973 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2019-10-07 13:29:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:16,974 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-10-07 13:29:16,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-07 13:29:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-10-07 13:29:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:29:16,976 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:16,977 INFO L385 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:17,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:17,182 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1953340067, now seen corresponding path program 4 times [2019-10-07 13:29:17,183 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:17,183 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:17,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:17,183 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:17,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:17,549 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:17,549 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:17,549 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-07 13:29:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:17,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 13:29:17,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:29:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:17,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:29:18,336 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:18,337 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:29:18,338 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:29:18,338 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:29:18,339 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:29:18,339 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:29:18,339 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:29:18,362 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:29:18,501 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:29:18,510 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:29:18,517 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:29:18,518 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:29:18,518 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:29:18,518 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:29:18,519 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_7 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_7) 4096) (select (select |#memory_int| v_prenex_8) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:18,519 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:29:18,519 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:29:18,520 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:29:18,520 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:29:18,520 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_7 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_7) 4096) (select (select |#memory_int| v_prenex_8) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:29:18,520 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_7 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_7) 4096) (select (select |#memory_int| v_prenex_8) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:18,521 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:29:18,521 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((v_prenex_7 Int) (|v_main_~#B~0.base_BEFORE_CALL_4| Int) (|v_main_~#A~0.base_BEFORE_CALL_4| Int) (v_prenex_8 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_7) 4096) (select (select |#memory_int| v_prenex_8) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_4|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_4|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:29:18,972 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:29:18,972 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 9] total 58 [2019-10-07 13:29:18,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-07 13:29:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-07 13:29:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=2105, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 13:29:18,977 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 58 states. [2019-10-07 13:29:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:29:22,186 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2019-10-07 13:29:22,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-07 13:29:22,187 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 32 [2019-10-07 13:29:22,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:29:22,189 INFO L225 Difference]: With dead ends: 62 [2019-10-07 13:29:22,189 INFO L226 Difference]: Without dead ends: 57 [2019-10-07 13:29:22,194 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2554 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3594, Invalid=8396, Unknown=0, NotChecked=0, Total=11990 [2019-10-07 13:29:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-07 13:29:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-10-07 13:29:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-07 13:29:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-10-07 13:29:22,206 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2019-10-07 13:29:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:29:22,206 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-10-07 13:29:22,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-07 13:29:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-10-07 13:29:22,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-07 13:29:22,208 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:29:22,208 INFO L385 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:29:22,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:29:22,413 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:29:22,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:29:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash -751283549, now seen corresponding path program 5 times [2019-10-07 13:29:22,414 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:29:22,414 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:22,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:22,415 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:29:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:29:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:29:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:29:23,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:29:23,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:29:23,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:43,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-07 13:30:43,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:30:43,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-07 13:30:43,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:30:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:43,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:30:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:30:46,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:30:46,073 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:30:46,074 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:30:46,074 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:30:46,074 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:30:46,074 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:30:46,105 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:30:46,244 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:30:46,251 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:30:46,254 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:30:46,254 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:30:46,255 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:30:46,259 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_9) 4096) (select (select |#memory_int| v_prenex_10) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 13:30:46,260 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 13:30:46,260 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:30:46,260 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:30:46,260 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:30:46,261 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:30:46,261 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_9) 4096) (select (select |#memory_int| v_prenex_10) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:30:46,261 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_9) 4096) (select (select |#memory_int| v_prenex_10) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 13:30:46,262 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((|v_main_~#B~0.base_BEFORE_CALL_5| Int) (|v_main_~#A~0.base_BEFORE_CALL_5| Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| v_prenex_9) 4096) (select (select |#memory_int| v_prenex_10) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_5|) 4096) (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_5|) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0))))) [2019-10-07 13:30:46,262 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(or (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= 0 |main_~#A~0.offset|) (<= 0 |#NULL.offset|) (<= |main_~#B~0.offset| 0) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (<= |#NULL.base| 0) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0))) [2019-10-07 13:30:46,859 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:30:46,859 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49, 9] total 106 [2019-10-07 13:30:46,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-10-07 13:30:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-10-07 13:30:46,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4681, Invalid=6449, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 13:30:46,865 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 106 states. [2019-10-07 13:30:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:30:57,782 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2019-10-07 13:30:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-07 13:30:57,783 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 56 [2019-10-07 13:30:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:30:57,785 INFO L225 Difference]: With dead ends: 110 [2019-10-07 13:30:57,785 INFO L226 Difference]: Without dead ends: 105 [2019-10-07 13:30:57,794 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8014 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=14034, Invalid=28196, Unknown=0, NotChecked=0, Total=42230 [2019-10-07 13:30:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-07 13:30:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-10-07 13:30:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-07 13:30:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-10-07 13:30:57,811 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2019-10-07 13:30:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:30:57,812 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-10-07 13:30:57,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-10-07 13:30:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-10-07 13:30:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 13:30:57,815 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:30:57,816 INFO L385 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:30:58,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:30:58,017 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:30:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:30:58,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1960166051, now seen corresponding path program 6 times [2019-10-07 13:30:58,018 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:30:58,018 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:30:58,018 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:58,018 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:30:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:30:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:01,611 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:01,612 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:31:01,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:01,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:31:01,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:31:01,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 96 conjunts are in the unsatisfiable core [2019-10-07 13:31:01,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:01,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:31:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:12,137 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:31:12,138 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:31:12,138 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:31:12,139 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:31:12,139 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:31:12,139 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:31:12,162 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:31:12,279 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:31:12,295 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:31:12,298 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:31:12,298 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:31:12,299 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:31:12,299 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:31:12,299 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_12) 4096) (select (select |#memory_int| v_prenex_11) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:12,299 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:31:12,300 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:31:12,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:31:12,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:31:12,300 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_12) 4096) (select (select |#memory_int| v_prenex_11) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:31:12,300 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_12) 4096) (select (select |#memory_int| v_prenex_11) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:12,301 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#B~0.base_BEFORE_CALL_6| Int) (|v_main_~#A~0.base_BEFORE_CALL_6| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_6|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_6|) 4096))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (select (select |#memory_int| v_prenex_12) 4096) (select (select |#memory_int| v_prenex_11) 4096)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:31:12,301 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:31:13,135 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:31:13,135 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97, 9] total 202 [2019-10-07 13:31:13,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-10-07 13:31:13,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-10-07 13:31:13,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18553, Invalid=22049, Unknown=0, NotChecked=0, Total=40602 [2019-10-07 13:31:13,165 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 202 states. [2019-10-07 13:31:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:31:40,706 INFO L93 Difference]: Finished difference Result 206 states and 301 transitions. [2019-10-07 13:31:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2019-10-07 13:31:40,706 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 104 [2019-10-07 13:31:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:31:40,710 INFO L225 Difference]: With dead ends: 206 [2019-10-07 13:31:40,710 INFO L226 Difference]: Without dead ends: 201 [2019-10-07 13:31:40,725 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 396 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27574 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=55650, Invalid=102356, Unknown=0, NotChecked=0, Total=158006 [2019-10-07 13:31:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-07 13:31:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-10-07 13:31:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-07 13:31:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-10-07 13:31:40,758 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 104 [2019-10-07 13:31:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:31:40,758 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-10-07 13:31:40,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-10-07 13:31:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-10-07 13:31:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-07 13:31:40,762 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:31:40,762 INFO L385 BasicCegarLoop]: trace histogram [190, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:31:40,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:40,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:31:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:31:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1748017827, now seen corresponding path program 7 times [2019-10-07 13:31:40,969 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:31:40,969 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:40,969 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:40,970 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:31:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:31:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:54,032 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:31:54,032 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:31:54,032 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:31:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:31:54,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 192 conjunts are in the unsatisfiable core [2019-10-07 13:31:54,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:31:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:31:54,442 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:32:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:32:32,905 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:32:32,906 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-07 13:32:32,906 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:32:32,907 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:32:32,907 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:32:32,908 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:32:32,944 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 13:32:33,042 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 34 for LOIs [2019-10-07 13:32:33,049 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 13:32:33,051 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:32:33,052 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:32:33,052 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:32:33,052 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 13:32:33,052 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_14) 4096) (select (select |#memory_int| v_prenex_13) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:33,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:32:33,053 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 76#(and (= (select (select |#memory_int| |main_~#A~0.base|) (+ |main_~#A~0.offset| 4096)) |main_#t~mem2|) (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (<= |#NULL.base| 0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#B~0.base|) (+ |main_~#B~0.offset| 4096))) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (not (< main_~i~0 2048)) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0) (<= 0 |main_~#B~0.offset|) (<= 2048 main_~i~0) (= |#NULL.offset| 0)) [2019-10-07 13:32:33,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:32:33,053 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:32:33,053 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_14) 4096) (select (select |#memory_int| v_prenex_13) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-07 13:32:33,054 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 91#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_14) 4096) (select (select |#memory_int| v_prenex_13) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:33,054 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(and (exists ((|v_main_~#B~0.base_BEFORE_CALL_7| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#A~0.base_BEFORE_CALL_7| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (select (select |#memory_int| |v_main_~#A~0.base_BEFORE_CALL_7|) 4096) (select (select |#memory_int| |v_main_~#B~0.base_BEFORE_CALL_7|) 4096))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= (select (select |#memory_int| v_prenex_14) 4096) (select (select |#memory_int| v_prenex_13) 4096)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 13:32:33,054 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 71#(and (or (and (= |#NULL.base| 0) (<= 0 |main_~#A~0.offset|) (<= 0 main_~i~0) (= |main_~#B~0.offset| 0) (= |main_~#A~0.offset| 0) (<= 0 |main_~#B~0.offset|) (= |#NULL.offset| 0)) (and (<= 0 main_~i~0) (= 0 |#NULL.base|) (= 0 |main_~#A~0.offset|) (not (= 0 |main_~#A~0.base|)) (= |#length| (store (store |old(#length)| |main_~#A~0.base| 8192) |main_~#B~0.base| 8192)) (= |#valid| (store (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base| 1)) (= (select |old(#valid)| |main_~#A~0.base|) 0) (<= 0 |main_~#A~0.offset|) (< |main_~#B~0.base| |#StackHeapBarrier|) (= (select (store |old(#valid)| |main_~#A~0.base| 1) |main_~#B~0.base|) 0) (not (= |main_~#B~0.base| 0)) (= 0 |main_~#B~0.offset|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |main_~#B~0.offset|) (< |main_~#A~0.base| |#StackHeapBarrier|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0))) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |main_~#A~0.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#B~0.offset| 0)) [2019-10-07 13:32:34,461 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:32:34,462 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [193, 193, 193, 9] total 394 [2019-10-07 13:32:34,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 394 states [2019-10-07 13:32:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 394 interpolants. [2019-10-07 13:32:34,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73945, Invalid=80897, Unknown=0, NotChecked=0, Total=154842 [2019-10-07 13:32:34,476 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 394 states. [2019-10-07 13:34:15,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:15,934 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2019-10-07 13:34:15,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2019-10-07 13:34:15,934 INFO L78 Accepts]: Start accepts. Automaton has 394 states. Word has length 200 [2019-10-07 13:34:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:15,939 INFO L225 Difference]: With dead ends: 398 [2019-10-07 13:34:15,939 INFO L226 Difference]: Without dead ends: 393 [2019-10-07 13:34:15,951 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1180 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 780 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101254 ImplicationChecksByTransitivity, 148.7s TimeCoverageRelationStatistics Valid=221826, Invalid=388916, Unknown=0, NotChecked=0, Total=610742 [2019-10-07 13:34:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-07 13:34:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2019-10-07 13:34:15,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 13:34:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-10-07 13:34:15,992 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 200 [2019-10-07 13:34:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:15,993 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-10-07 13:34:15,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 394 states. [2019-10-07 13:34:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-10-07 13:34:16,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-10-07 13:34:16,002 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:16,002 INFO L385 BasicCegarLoop]: trace histogram [382, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:16,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:16,208 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 258368163, now seen corresponding path program 8 times [2019-10-07 13:34:16,209 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:16,209 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:16,209 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:16,210 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:35:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 73153 backedges. 0 proven. 73153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:35:08,783 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:35:08,783 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:35:08,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true