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/array-examples/standard_vararg_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:29:52,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:29:52,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:29:52,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:29:52,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:29:52,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:29:52,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:29:52,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:29:52,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:29:52,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:29:52,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:29:52,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:29:52,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:29:52,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:29:52,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:29:52,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:29:52,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:29:52,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:29:52,611 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:29:52,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:29:52,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:29:52,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:29:52,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:29:52,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:29:52,627 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:29:52,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:29:52,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:29:52,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:29:52,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:29:52,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:29:52,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:29:52,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:29:52,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:29:52,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:29:52,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:29:52,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:29:52,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:29:52,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:29:52,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:29:52,643 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:29:52,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:29:52,645 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 00:29:52,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:29:52,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:29:52,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:29:52,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:29:52,669 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:29:52,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:29:52,670 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:29:52,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:29:52,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:29:52,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:29:52,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:29:52,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:29:52,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:29:52,672 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:29:52,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:29:52,673 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:29:52,673 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:29:52,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:29:52,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:29:52,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:29:52,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:29:52,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:29:52,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:29:52,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:29:52,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:29:52,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:29:52,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:29:52,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:29:52,675 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 00:29:52,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:29:52,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:29:53,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:29:53,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:29:53,003 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:29:53,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-07 00:29:53,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fdedc4/986db85bfe574fb9b0c9b3d2fa2b5a63/FLAG1f1a6535c [2019-10-07 00:29:53,555 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:29:53,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_vararg_ground.i [2019-10-07 00:29:53,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fdedc4/986db85bfe574fb9b0c9b3d2fa2b5a63/FLAG1f1a6535c [2019-10-07 00:29:53,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba2fdedc4/986db85bfe574fb9b0c9b3d2fa2b5a63 [2019-10-07 00:29:53,908 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:29:53,910 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:29:53,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:29:53,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:29:53,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:29:53,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:29:53" (1/1) ... [2019-10-07 00:29:53,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137de84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:53, skipping insertion in model container [2019-10-07 00:29:53,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:29:53" (1/1) ... [2019-10-07 00:29:53,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:29:53,944 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:29:54,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:29:54,153 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:29:54,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:29:54,189 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:29:54,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54 WrapperNode [2019-10-07 00:29:54,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:29:54,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:29:54,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:29:54,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:29:54,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (1/1) ... [2019-10-07 00:29:54,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:29:54,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:29:54,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:29:54,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:29:54,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (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 00:29:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:29:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:29:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:29:54,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:29:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:29:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:29:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:29:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:29:54,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:29:54,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:29:54,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:29:54,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:29:54,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:29:54,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:29:54,724 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:29:54,724 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:29:54,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:29:54 BoogieIcfgContainer [2019-10-07 00:29:54,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:29:54,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:29:54,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:29:54,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:29:54,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:29:53" (1/3) ... [2019-10-07 00:29:54,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75844bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:29:54, skipping insertion in model container [2019-10-07 00:29:54,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:29:54" (2/3) ... [2019-10-07 00:29:54,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75844bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:29:54, skipping insertion in model container [2019-10-07 00:29:54,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:29:54" (3/3) ... [2019-10-07 00:29:54,736 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_vararg_ground.i [2019-10-07 00:29:54,748 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:29:54,759 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:29:54,772 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:29:54,809 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:29:54,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:29:54,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:29:54,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:29:54,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:29:54,810 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:29:54,810 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:29:54,810 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:29:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-07 00:29:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:29:54,830 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:54,831 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:54,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:54,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash -226467410, now seen corresponding path program 1 times [2019-10-07 00:29:54,844 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:54,844 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:54,845 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:54,845 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:54,973 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 00:29:54,974 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:54,974 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:29:54,975 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 00:29:54,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 00:29:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 00:29:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:29:54,996 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-07 00:29:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:55,019 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-07 00:29:55,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 00:29:55,020 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-07 00:29:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:55,027 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:29:55,028 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:29:55,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:29:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:29:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:29:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:29:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:29:55,066 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:29:55,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:55,066 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:29:55,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 00:29:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:29:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:29:55,068 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:55,068 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:55,068 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 972942376, now seen corresponding path program 1 times [2019-10-07 00:29:55,069 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:55,069 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:55,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:55,070 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:55,124 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 00:29:55,125 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:55,126 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:29:55,126 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:29:55,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:29:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:29:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:29:55,129 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-07 00:29:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:55,147 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-07 00:29:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:29:55,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-07 00:29:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:55,149 INFO L225 Difference]: With dead ends: 31 [2019-10-07 00:29:55,150 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:29:55,151 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 00:29:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:29:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 00:29:55,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:29:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-07 00:29:55,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-07 00:29:55,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:55,159 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-07 00:29:55,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:29:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-07 00:29:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:29:55,161 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:55,161 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:55,161 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2103799838, now seen corresponding path program 1 times [2019-10-07 00:29:55,162 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:55,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:55,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:55,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:55,280 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 00:29:55,280 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:55,283 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:55,283 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 00:29:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:55,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:29:55,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:55,402 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 00:29:55,402 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:55,433 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 00:29:55,434 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:55,460 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 00:29:55,461 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:55,468 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:55,476 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:55,477 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:55,642 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:55,870 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:29:55,889 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:55,898 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:55,898 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:55,899 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 83#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:29:55,899 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 103#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:55,900 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 73#(and (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:29:55,900 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 108#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))))) (<= __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 00:29:55,900 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 117#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:55,901 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 78#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:29:55,901 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 113#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))))) (<= __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 00:29:55,902 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 88#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:29:55,902 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 00:29:55,902 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 00:29:55,903 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 122#(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 00:29:55,903 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:29:55,903 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:55,904 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 93#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:29:55,904 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 98#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_1| Int) (v_main_~a~0_BEFORE_CALL_1 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_1| Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0)) (and (< 0 v_main_~a~0_BEFORE_CALL_1) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) (+ (* 4 v_main_~a~0_BEFORE_CALL_1) |v_main_~#aa~0.offset_BEFORE_CALL_1|)) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_1|) |v_main_~#aa~0.offset_BEFORE_CALL_1|)))))) [2019-10-07 00:29:56,377 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:56,378 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 19 [2019-10-07 00:29:56,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-07 00:29:56,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-07 00:29:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-10-07 00:29:56,384 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 19 states. [2019-10-07 00:29:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:57,087 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-07 00:29:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-07 00:29:57,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-10-07 00:29:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:57,089 INFO L225 Difference]: With dead ends: 43 [2019-10-07 00:29:57,089 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 00:29:57,091 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2019-10-07 00:29:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 00:29:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-07 00:29:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-07 00:29:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-07 00:29:57,098 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-07 00:29:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:57,099 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-07 00:29:57,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-07 00:29:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-07 00:29:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 00:29:57,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:57,100 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:57,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:57,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1715848792, now seen corresponding path program 2 times [2019-10-07 00:29:57,306 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:57,306 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:57,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:57,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:57,427 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 00:29:57,427 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:57,427 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:57,427 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 00:29:57,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-07 00:29:57,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:57,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:29:57,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:29:57,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:29:57,521 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 00:29:57,522 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7] total 10 [2019-10-07 00:29:57,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 00:29:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 00:29:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:29:57,524 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-10-07 00:29:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:57,545 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2019-10-07 00:29:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:29:57,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-07 00:29:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:57,547 INFO L225 Difference]: With dead ends: 35 [2019-10-07 00:29:57,547 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 00:29:57,548 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-07 00:29:57,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 00:29:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-07 00:29:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:29:57,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:29:57,560 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2019-10-07 00:29:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:57,560 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:29:57,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 00:29:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:29:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:29:57,562 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:57,562 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:57,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:57,766 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2017594605, now seen corresponding path program 1 times [2019-10-07 00:29:57,766 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:57,766 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:57,766 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:57,767 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:29:57,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:57,840 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:57,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-07 00:29:57,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:29:57,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:29:57,976 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:57,977 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 00:29:57,977 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:57,978 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:57,979 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:57,980 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:58,027 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:58,172 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:29:58,183 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:58,188 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:58,188 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:58,189 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:29:58,189 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))) (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:58,189 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 109#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:29:58,189 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))) (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))))) (<= __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 00:29:58,190 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:58,190 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:29:58,190 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))) (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))))) (<= __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 00:29:58,191 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 98#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:29:58,191 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 00:29:58,191 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 00:29:58,191 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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 00:29:58,192 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:29:58,192 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:58,192 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 103#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:29:58,192 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_2| Int) (v_main_~a~0_BEFORE_CALL_2 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_2| Int)) (or (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 0) (< 0 v_main_~a~0_BEFORE_CALL_2) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|)))) (and (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) (+ (* 4 v_main_~a~0_BEFORE_CALL_2) |v_main_~#aa~0.offset_BEFORE_CALL_2|)) 0) (= |__VERIFIER_assert_#in~cond| 1) (< 0 v_main_~a~0_BEFORE_CALL_2) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_2|) |v_main_~#aa~0.offset_BEFORE_CALL_2|))))) [2019-10-07 00:29:58,557 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:58,557 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-07 00:29:58,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 00:29:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 00:29:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-10-07 00:29:58,559 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 25 states. [2019-10-07 00:29:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:59,311 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2019-10-07 00:29:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-07 00:29:59,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-07 00:29:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:59,314 INFO L225 Difference]: With dead ends: 53 [2019-10-07 00:29:59,314 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 00:29:59,315 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:29:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 00:29:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-10-07 00:29:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 00:29:59,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-07 00:29:59,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2019-10-07 00:29:59,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:59,324 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-07 00:29:59,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 00:29:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-07 00:29:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 00:29:59,325 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:59,325 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:59,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:59,529 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:59,530 INFO L82 PathProgramCache]: Analyzing trace with hash 174016813, now seen corresponding path program 2 times [2019-10-07 00:29:59,531 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:59,531 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:59,531 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:59,532 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:59,660 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:29:59,660 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:59,661 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:59,661 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 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 00:29:59,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:29:59,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:29:59,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-07 00:29:59,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:29:59,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:59,993 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 00:29:59,994 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:59,995 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 00:29:59,995 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:59,996 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:59,996 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:59,996 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:00,031 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:00,127 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-07 00:30:00,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:00,149 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:00,149 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:00,149 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:00,150 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 118#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|))) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:00,150 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 109#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:00,150 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 123#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|))) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:00,150 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 132#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:00,150 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:00,151 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 128#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|))) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:00,151 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 98#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:30:00,151 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 00:30:00,151 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 00:30:00,152 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:00,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 137#(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 00:30:00,152 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:00,152 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 103#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (< main_~x~0 main_~a~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:30:00,154 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 113#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_3| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_3| Int) (v_main_~a~0_BEFORE_CALL_3 Int)) (or (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 1) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|))) (and (< 0 v_main_~a~0_BEFORE_CALL_3) (= |__VERIFIER_assert_#in~cond| 0) (< (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_3| (* 4 v_main_~a~0_BEFORE_CALL_3))) 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_3|) |v_main_~#aa~0.offset_BEFORE_CALL_3|)))))) [2019-10-07 00:30:00,658 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:00,659 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9, 13] total 38 [2019-10-07 00:30:00,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-07 00:30:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-07 00:30:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1254, Unknown=0, NotChecked=0, Total=1406 [2019-10-07 00:30:00,663 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 38 states. [2019-10-07 00:30:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:02,103 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-10-07 00:30:02,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:30:02,104 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 26 [2019-10-07 00:30:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:02,105 INFO L225 Difference]: With dead ends: 52 [2019-10-07 00:30:02,105 INFO L226 Difference]: Without dead ends: 38 [2019-10-07 00:30:02,108 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=3205, Unknown=0, NotChecked=0, Total=3660 [2019-10-07 00:30:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-07 00:30:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-07 00:30:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-07 00:30:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-07 00:30:02,116 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2019-10-07 00:30:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:02,117 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-07 00:30:02,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-07 00:30:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-07 00:30:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-07 00:30:02,118 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:02,118 INFO L385 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:02,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:02,329 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash 734264083, now seen corresponding path program 1 times [2019-10-07 00:30:02,329 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:02,330 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:02,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:02,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-07 00:30:02,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:02,406 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:30:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:02,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-07 00:30:02,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-07 00:30:02,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 2 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-07 00:30:02,863 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:02,865 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:30:02,865 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:02,866 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:02,866 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:02,866 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:02,909 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:03,146 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:30:03,159 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:03,164 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:03,165 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:03,165 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:03,165 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:03,168 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:03,168 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:03,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:03,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:03,171 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:03,171 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:03,171 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:30:03,171 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 00:30:03,172 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 00:30:03,172 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:03,172 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:30:03,173 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:03,173 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:03,173 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:03,173 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) [2019-10-07 00:30:03,173 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_10| Int) (v_main_~x~0_BEFORE_CALL_10 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))) (<= 0 v_main_~x~0_BEFORE_CALL_10)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_10) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_10|) (+ (* 4 v_main_~x~0_BEFORE_CALL_10) |v_main_~#aa~0.offset_BEFORE_CALL_10|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:03,688 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:03,688 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 14, 15] total 44 [2019-10-07 00:30:03,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-07 00:30:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-07 00:30:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1513, Unknown=0, NotChecked=0, Total=1892 [2019-10-07 00:30:03,691 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 44 states. [2019-10-07 00:30:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:05,828 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2019-10-07 00:30:05,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-07 00:30:05,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 34 [2019-10-07 00:30:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:05,832 INFO L225 Difference]: With dead ends: 77 [2019-10-07 00:30:05,833 INFO L226 Difference]: Without dead ends: 52 [2019-10-07 00:30:05,836 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1305, Invalid=6527, Unknown=0, NotChecked=0, Total=7832 [2019-10-07 00:30:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-07 00:30:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-07 00:30:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-07 00:30:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-07 00:30:05,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 34 [2019-10-07 00:30:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:05,849 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-07 00:30:05,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-07 00:30:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-07 00:30:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 00:30:05,851 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:05,851 INFO L385 BasicCegarLoop]: trace histogram [24, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:06,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:06,055 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1918466532, now seen corresponding path program 2 times [2019-10-07 00:30:06,056 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:06,056 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:06,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:06,057 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:06,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:06,513 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 2 proven. 300 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-07 00:30:06,514 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:06,514 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:06,514 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 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 00:30:06,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-07 00:30:06,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:30:06,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-07 00:30:06,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-07 00:30:07,066 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-07 00:30:07,417 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:07,418 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:30:07,418 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:07,419 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:07,419 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:07,419 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:07,440 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:07,619 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:30:07,629 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:07,632 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:07,632 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:07,633 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:07,633 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:07,633 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:07,633 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:07,633 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:07,634 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:07,635 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:07,635 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:07,635 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:30:07,636 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 00:30:07,639 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 00:30:07,640 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:30:07,640 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:07,641 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:07,646 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:07,646 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:07,647 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) [2019-10-07 00:30:07,647 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_21| Int) (v_main_~x~0_BEFORE_CALL_21 Int) (|v_main_~#aa~0.offset_BEFORE_CALL_21| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_21) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|)))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_21) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_21|) (+ (* 4 v_main_~x~0_BEFORE_CALL_21) |v_main_~#aa~0.offset_BEFORE_CALL_21|))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:10,619 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:10,619 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 11, 15] total 62 [2019-10-07 00:30:10,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-10-07 00:30:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-10-07 00:30:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=3289, Unknown=1, NotChecked=0, Total=3782 [2019-10-07 00:30:10,623 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 62 states. [2019-10-07 00:30:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:28,394 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-10-07 00:30:28,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-07 00:30:28,395 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 49 [2019-10-07 00:30:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:28,396 INFO L225 Difference]: With dead ends: 81 [2019-10-07 00:30:28,397 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 00:30:28,400 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2799 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1543, Invalid=10228, Unknown=1, NotChecked=0, Total=11772 [2019-10-07 00:30:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 00:30:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-10-07 00:30:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-07 00:30:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-10-07 00:30:28,410 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 49 [2019-10-07 00:30:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:28,411 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-10-07 00:30:28,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-10-07 00:30:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-10-07 00:30:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 00:30:28,413 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:28,414 INFO L385 BasicCegarLoop]: trace histogram [25, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:28,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:28,618 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2001767768, now seen corresponding path program 3 times [2019-10-07 00:30:28,619 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:28,619 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:28,619 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:28,619 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 4 proven. 325 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-07 00:30:29,001 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:29,001 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:29,001 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 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 00:30:29,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:30:29,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:30:29,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 00:30:29,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-10-07 00:30:29,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2019-10-07 00:30:29,347 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:29,348 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:30:29,348 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:29,349 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:29,349 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:29,349 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:29,374 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:29,508 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:30:29,515 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:29,518 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:29,518 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:29,518 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:29,519 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:29,519 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:29,519 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) (<= __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 00:30:29,519 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:29,519 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:29,520 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:29,520 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) (<= __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 00:30:29,520 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:30:29,520 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 00:30:29,521 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 00:30:29,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:30:29,521 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:29,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:29,521 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:29,521 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:29,522 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) [2019-10-07 00:30:29,522 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_30| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_30| Int) (v_main_~x~0_BEFORE_CALL_34 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_34) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_34) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_30|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_30| (* 4 v_main_~x~0_BEFORE_CALL_34))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:30,099 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:30,099 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 8, 8, 15] total 51 [2019-10-07 00:30:30,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-07 00:30:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-07 00:30:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=2092, Unknown=0, NotChecked=0, Total=2550 [2019-10-07 00:30:30,103 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 51 states. [2019-10-07 00:30:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:32,913 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2019-10-07 00:30:32,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-07 00:30:32,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 57 [2019-10-07 00:30:32,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:32,915 INFO L225 Difference]: With dead ends: 96 [2019-10-07 00:30:32,915 INFO L226 Difference]: Without dead ends: 61 [2019-10-07 00:30:32,918 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1621, Invalid=8885, Unknown=0, NotChecked=0, Total=10506 [2019-10-07 00:30:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-07 00:30:32,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-07 00:30:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-07 00:30:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-10-07 00:30:32,929 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 57 [2019-10-07 00:30:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:32,930 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-10-07 00:30:32,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-07 00:30:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-10-07 00:30:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 00:30:32,931 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:32,931 INFO L385 BasicCegarLoop]: trace histogram [26, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:33,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:33,139 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1846334217, now seen corresponding path program 4 times [2019-10-07 00:30:33,140 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:33,141 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:33,141 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:33,141 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:33,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 4 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 00:30:33,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:33,499 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:33,499 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 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 [2019-10-07 00:30:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:33,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-07 00:30:33,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-07 00:30:33,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 4 proven. 351 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 00:30:34,574 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:34,576 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:30:34,576 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:34,576 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:34,576 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:34,577 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:34,591 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:34,720 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:30:34,727 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:34,744 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:34,744 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:34,745 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:34,745 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:34,745 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:34,745 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:34,745 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:34,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:34,746 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:34,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:34,746 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:30:34,746 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 00:30:34,747 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 00:30:34,747 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:30:34,747 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:34,747 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:34,747 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:34,747 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:34,748 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) [2019-10-07 00:30:34,748 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_43 Int) (|v_main_~#aa~0.base_BEFORE_CALL_39| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_39| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|)))) (<= 0 v_main_~x~0_BEFORE_CALL_43)) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_39|) (+ (* 4 v_main_~x~0_BEFORE_CALL_43) |v_main_~#aa~0.offset_BEFORE_CALL_39|))) (<= 0 v_main_~x~0_BEFORE_CALL_43)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:35,217 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:35,217 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29, 15] total 71 [2019-10-07 00:30:35,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-10-07 00:30:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-10-07 00:30:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1640, Invalid=3330, Unknown=0, NotChecked=0, Total=4970 [2019-10-07 00:30:35,221 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 71 states. [2019-10-07 00:30:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:30:38,257 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2019-10-07 00:30:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-07 00:30:38,257 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 60 [2019-10-07 00:30:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:30:38,259 INFO L225 Difference]: With dead ends: 118 [2019-10-07 00:30:38,259 INFO L226 Difference]: Without dead ends: 89 [2019-10-07 00:30:38,264 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4495 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4813, Invalid=13547, Unknown=0, NotChecked=0, Total=18360 [2019-10-07 00:30:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-07 00:30:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-10-07 00:30:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-07 00:30:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2019-10-07 00:30:38,276 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 60 [2019-10-07 00:30:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:30:38,276 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2019-10-07 00:30:38,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-10-07 00:30:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2019-10-07 00:30:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 00:30:38,278 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:30:38,278 INFO L385 BasicCegarLoop]: trace histogram [54, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:30:38,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:38,482 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:30:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:30:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1690184567, now seen corresponding path program 5 times [2019-10-07 00:30:38,483 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:30:38,483 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:38,484 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:38,484 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:30:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:30:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:30:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 4 proven. 1485 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 00:30:39,937 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:30:39,938 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:30:39,938 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:30:40,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:30:40,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:30:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-07 00:30:40,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:30:40,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-07 00:30:40,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:30:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2019-10-07 00:30:41,165 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:30:41,166 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:30:41,167 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:30:41,167 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:30:41,167 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:30:41,168 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:30:41,197 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:30:41,309 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:30:41,319 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:30:41,327 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:30:41,328 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:30:41,328 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:30:41,328 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:41,328 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:30:41,328 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) (<= 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 00:30:41,329 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:30:41,329 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:41,329 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:30:41,329 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) (<= 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 00:30:41,329 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:30:41,329 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 00:30:41,330 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 00:30:41,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:30:41,330 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:30:41,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:30:41,330 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:41,330 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:30:41,331 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) [2019-10-07 00:30:41,331 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_52| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_52| Int) (v_main_~x~0_BEFORE_CALL_56 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_56) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56))))) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_56) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_52|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_52| (* 4 v_main_~x~0_BEFORE_CALL_56)))))))) (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:30:44,251 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:30:44,251 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 16, 13, 15] total 95 [2019-10-07 00:30:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-07 00:30:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-07 00:30:44,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1722, Invalid=7207, Unknown=1, NotChecked=0, Total=8930 [2019-10-07 00:30:44,255 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand 95 states. [2019-10-07 00:31:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:31:13,955 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-10-07 00:31:13,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-10-07 00:31:13,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 88 [2019-10-07 00:31:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:31:13,957 INFO L225 Difference]: With dead ends: 125 [2019-10-07 00:31:13,957 INFO L226 Difference]: Without dead ends: 96 [2019-10-07 00:31:13,961 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6793 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=5422, Invalid=25729, Unknown=1, NotChecked=0, Total=31152 [2019-10-07 00:31:13,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-07 00:31:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2019-10-07 00:31:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-07 00:31:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-07 00:31:13,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 88 [2019-10-07 00:31:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:31:13,975 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-07 00:31:13,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-07 00:31:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-07 00:31:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 00:31:13,977 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:31:13,977 INFO L385 BasicCegarLoop]: trace histogram [55, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:31:14,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:14,181 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:31:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:31:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash -802354167, now seen corresponding path program 6 times [2019-10-07 00:31:14,182 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:31:14,182 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:14,182 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:14,182 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:31:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-07 00:31:14,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:14,334 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:31:14,334 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:14,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:31:14,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:31:14,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-07 00:31:14,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:14,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-07 00:31:14,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2019-10-07 00:31:14,666 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:14,667 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:31:14,667 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:14,668 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:14,668 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:14,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:14,689 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:31:14,790 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:31:14,806 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:31:14,811 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:14,811 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:14,811 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:14,812 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:31:14,813 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:14,813 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:31:14,813 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 00:31:14,813 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 00:31:14,813 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:31:14,814 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:31:14,814 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:14,814 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:14,814 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:14,814 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) [2019-10-07 00:31:14,815 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((v_main_~x~0_BEFORE_CALL_71 Int) (|v_main_~#aa~0.base_BEFORE_CALL_61| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_61| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_71) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_71) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_61|) (+ (* 4 v_main_~x~0_BEFORE_CALL_71) |v_main_~#aa~0.offset_BEFORE_CALL_61|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:15,183 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:15,184 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 15] total 30 [2019-10-07 00:31:15,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-07 00:31:15,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-07 00:31:15,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2019-10-07 00:31:15,186 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 30 states. [2019-10-07 00:31:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:31:16,673 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-10-07 00:31:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-07 00:31:16,674 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2019-10-07 00:31:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:31:16,676 INFO L225 Difference]: With dead ends: 115 [2019-10-07 00:31:16,676 INFO L226 Difference]: Without dead ends: 95 [2019-10-07 00:31:16,677 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 264 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=519, Invalid=3141, Unknown=0, NotChecked=0, Total=3660 [2019-10-07 00:31:16,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-07 00:31:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-07 00:31:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-07 00:31:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-07 00:31:16,690 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 96 [2019-10-07 00:31:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:31:16,690 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-07 00:31:16,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-07 00:31:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-07 00:31:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 00:31:16,692 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:31:16,693 INFO L385 BasicCegarLoop]: trace histogram [55, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:31:16,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:16,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:31:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:31:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1862206684, now seen corresponding path program 7 times [2019-10-07 00:31:16,898 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:31:16,898 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:16,898 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:16,899 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:31:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 6 proven. 1540 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 00:31:18,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:18,148 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:31:18,148 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:18,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-07 00:31:18,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-07 00:31:18,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1593 backedges. 6 proven. 1540 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 00:31:21,798 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:21,799 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:31:21,799 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:21,800 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:21,800 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:21,800 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:21,826 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:31:21,956 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:31:21,965 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:31:21,968 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:21,968 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:21,968 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:31:21,968 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:21,968 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:31:21,969 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:21,969 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:31:21,969 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:21,969 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:31:21,969 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:21,970 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:31:21,970 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 00:31:21,970 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 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:21,971 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) [2019-10-07 00:31:21,972 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_70| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_70| Int) (v_main_~x~0_BEFORE_CALL_80 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))) (<= 0 v_main_~x~0_BEFORE_CALL_80)) (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_80) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_70|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_70| (* 4 v_main_~x~0_BEFORE_CALL_80)))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:22,692 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:22,693 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58, 15] total 129 [2019-10-07 00:31:22,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-10-07 00:31:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-10-07 00:31:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6599, Invalid=9913, Unknown=0, NotChecked=0, Total=16512 [2019-10-07 00:31:22,697 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 129 states. [2019-10-07 00:31:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:31:32,087 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2019-10-07 00:31:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-07 00:31:32,087 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 98 [2019-10-07 00:31:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:31:32,089 INFO L225 Difference]: With dead ends: 186 [2019-10-07 00:31:32,089 INFO L226 Difference]: Without dead ends: 152 [2019-10-07 00:31:32,092 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13253 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19574, Invalid=43678, Unknown=0, NotChecked=0, Total=63252 [2019-10-07 00:31:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-07 00:31:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-10-07 00:31:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-10-07 00:31:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-10-07 00:31:32,108 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 98 [2019-10-07 00:31:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:31:32,109 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-10-07 00:31:32,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-10-07 00:31:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-10-07 00:31:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-07 00:31:32,113 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:31:32,113 INFO L385 BasicCegarLoop]: trace histogram [112, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:31:32,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:32,318 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:31:32,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:31:32,319 INFO L82 PathProgramCache]: Analyzing trace with hash -966239462, now seen corresponding path program 8 times [2019-10-07 00:31:32,319 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:31:32,320 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:32,320 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:32,321 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:31:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:31:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:31:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 6 proven. 6328 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-07 00:31:36,995 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:31:36,995 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:31:36,995 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:31:37,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-07 00:31:37,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:31:37,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-07 00:31:37,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:31:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 6340 trivial. 0 not checked. [2019-10-07 00:31:38,656 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:31:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6381 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 6340 trivial. 0 not checked. [2019-10-07 00:31:39,677 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:31:39,678 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-07 00:31:39,678 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:31:39,678 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:31:39,679 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:31:39,679 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:31:39,695 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:31:39,806 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 21 for LOIs [2019-10-07 00:31:39,813 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:31:39,816 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:31:39,816 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:31:39,816 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 93#(and (< (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000))) [2019-10-07 00:31:39,816 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 197#(and (exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:39,816 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 188#(and (not (< main_~i~0 100000)) (<= 100000 main_~i~0)) [2019-10-07 00:31:39,817 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 212#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:39,817 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 221#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:31:39,817 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 207#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:39,817 INFO L193 IcfgInterpreter]: Reachable states at location L14 satisfy 88#(and (<= 100000 main_~i~0) (= (select (select |#memory_int| |main_~#aa~0.base|) (+ |main_~#aa~0.offset| (* 4 main_~a~0))) |main_#t~mem2|) (not (< main_~i~0 100000))) [2019-10-07 00:31:39,817 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 217#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:39,818 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 165#(and (<= 100000 main_~i~0) (<= 0 main_~x~0)) [2019-10-07 00:31:39,818 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 00:31:39,818 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 00:31:39,818 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 226#(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 00:31:39,818 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-07 00:31:39,818 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:31:39,819 INFO L193 IcfgInterpreter]: Reachable states at location L19-1 satisfy 183#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (<= 0 |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:39,819 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 170#(and (= (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|) (< main_~x~0 main_~a~0) (<= 100000 main_~i~0) (<= 0 main_~a~0) (<= 0 main_~x~0)) [2019-10-07 00:31:39,819 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 192#(exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) [2019-10-07 00:31:39,819 INFO L193 IcfgInterpreter]: Reachable states at location L2-3 satisfy 202#(and (not (= 0 __VERIFIER_assert_~cond)) (exists ((|v_main_~#aa~0.base_BEFORE_CALL_85| Int) (|v_main_~#aa~0.offset_BEFORE_CALL_85| Int) (v_main_~x~0_BEFORE_CALL_95 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~x~0_BEFORE_CALL_95) (not (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95)))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= 0 v_main_~x~0_BEFORE_CALL_95) (<= 0 (select (select |#memory_int| |v_main_~#aa~0.base_BEFORE_CALL_85|) (+ |v_main_~#aa~0.offset_BEFORE_CALL_85| (* 4 v_main_~x~0_BEFORE_CALL_95))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:31:43,179 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:31:43,179 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 16, 15, 15] total 155 [2019-10-07 00:31:43,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-10-07 00:31:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-10-07 00:31:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6729, Invalid=17140, Unknown=1, NotChecked=0, Total=23870 [2019-10-07 00:31:43,183 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 155 states. [2019-10-07 00:32:18,327 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-07 00:32:33,497 WARN L191 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-10-07 00:32:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:32:48,356 INFO L93 Difference]: Finished difference Result 200 states and 214 transitions. [2019-10-07 00:32:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2019-10-07 00:32:48,357 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2019-10-07 00:32:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:32:48,358 INFO L225 Difference]: With dead ends: 200 [2019-10-07 00:32:48,358 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 00:32:48,363 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 733 GetRequests, 421 SyntacticMatches, 5 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19175 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=21791, Invalid=73378, Unknown=3, NotChecked=0, Total=95172 [2019-10-07 00:32:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 00:32:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 00:32:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 00:32:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 00:32:48,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2019-10-07 00:32:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:32:48,364 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 00:32:48,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-10-07 00:32:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 00:32:48,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 00:32:48,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:32:48,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 00:32:50,312 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 313 DAG size of output: 1 [2019-10-07 00:32:50,948 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2019-10-07 00:32:51,651 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2019-10-07 00:32:51,654 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:32:51,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:32:51,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 00:32:51,654 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0) (<= 0 |#NULL.offset|)) [2019-10-07 00:32:51,654 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 00:32:51,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 00:32:51,654 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 5 22) no Hoare annotation was computed. [2019-10-07 00:32:51,654 INFO L439 ceAbstractionStarter]: At program point L19(line 19) the Hoare annotation is: (let ((.cse10 (select |#memory_int| |main_~#aa~0.base|))) (let ((.cse0 (<= 0 (select .cse10 |main_~#aa~0.offset|))) (.cse1 (= 0 |main_~#aa~0.offset|)) (.cse2 (= (select .cse10 (+ (* 4 main_~x~0) |main_~#aa~0.offset|)) |main_#t~mem5|)) (.cse3 (< (select .cse10 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0)) (.cse4 (< main_~x~0 main_~a~0)) (.cse5 (= main_~x~0 0)) (.cse6 (<= 100000 main_~i~0)) (.cse8 (<= 0 (select .cse10 (+ |main_~#aa~0.offset| 4)))) (.cse7 (= 0 (select |#valid| 0))) (.cse9 (<= main_~a~0 2))) (or (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |#NULL.offset| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~a~0 1) .cse5 .cse6 .cse7) (not (<= 0 |#NULL.base|)) (not (<= 0 |#NULL.offset|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7 (<= 1 main_~x~0) .cse9) (and .cse0 .cse1 (forall ((v_main_~x~0_71 Int)) (or (< v_main_~x~0_71 3) (<= main_~a~0 v_main_~x~0_71) (< 0 (+ (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~x~0_71) |main_~#aa~0.offset|)) 1)))) (<= 0 main_~x~0) (<= 0 (select .cse10 (+ |main_~#aa~0.offset| 8))) .cse2 .cse3 .cse4 .cse6 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse7 .cse9)))) [2019-10-07 00:32:51,654 INFO L443 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L439 ceAbstractionStarter]: At program point L9-3(lines 9 12) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0)) (and (= 0 |main_~#aa~0.offset|) (= main_~a~0 0) (= 0 (select |#valid| 0)))) [2019-10-07 00:32:51,655 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 5 22) the Hoare annotation is: (or (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) (not (= 0 (select |old(#valid)| 0))) (not (<= 0 |#NULL.offset|)) (not (<= |#NULL.base| 0))) [2019-10-07 00:32:51,655 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |main_~#aa~0.base|))) (let ((.cse3 (<= 0 main_~x~0)) (.cse4 (<= 0 (select .cse6 |main_~#aa~0.offset|))) (.cse5 (= 0 |main_~#aa~0.offset|)) (.cse0 (< (select .cse6 (+ |main_~#aa~0.offset| (* 4 main_~a~0))) 0)) (.cse1 (<= 100000 main_~i~0)) (.cse2 (= 0 (select |#valid| 0))) (.cse7 (<= 0 (select .cse6 (+ |main_~#aa~0.offset| 4)))) (.cse8 (<= main_~a~0 2))) (or (and .cse0 .cse1 .cse2 (<= main_~a~0 0) .cse3) (and .cse4 .cse5 (forall ((v_main_~x~0_71 Int)) (or (< v_main_~x~0_71 3) (<= main_~a~0 v_main_~x~0_71) (< 0 (+ (select (select |#memory_int| |main_~#aa~0.base|) (+ (* 4 v_main_~x~0_71) |main_~#aa~0.offset|)) 1)))) .cse3 (<= 0 (select .cse6 (+ |main_~#aa~0.offset| 8))) .cse0 .cse1 .cse2 .cse7) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and .cse4 .cse5 .cse0 (= main_~x~0 0) .cse1 .cse2 .cse7 .cse8) (not (<= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (and .cse0 .cse4 (<= main_~a~0 1) .cse5 .cse1 .cse2 .cse3) (not (<= 0 |#NULL.offset|)) (and .cse4 .cse5 .cse0 .cse1 .cse2 .cse7 (<= 1 main_~x~0) .cse8)))) [2019-10-07 00:32:51,655 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L443 ceAbstractionStarter]: For program point L14-2(lines 5 22) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L443 ceAbstractionStarter]: For program point L14-3(lines 14 16) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L443 ceAbstractionStarter]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L443 ceAbstractionStarter]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-10-07 00:32:51,655 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2019-10-07 00:32:51,656 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-10-07 00:32:51,656 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2019-10-07 00:32:51,656 INFO L443 ceAbstractionStarter]: For program point L2(line 2) no Hoare annotation was computed. [2019-10-07 00:32:51,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,684 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,685 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,686 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,687 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,688 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 12:32:51 BoogieIcfgContainer [2019-10-07 00:32:51,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 00:32:51,693 INFO L168 Benchmark]: Toolchain (without parser) took 177783.54 ms. Allocated memory was 145.2 MB in the beginning and 566.8 MB in the end (delta: 421.5 MB). Free memory was 103.4 MB in the beginning and 251.4 MB in the end (delta: -148.0 MB). Peak memory consumption was 471.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,693 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.12 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,694 INFO L168 Benchmark]: Boogie Preprocessor took 126.75 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 93.3 MB in the beginning and 180.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,694 INFO L168 Benchmark]: RCFGBuilder took 408.25 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 163.0 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,695 INFO L168 Benchmark]: TraceAbstraction took 176964.67 ms. Allocated memory was 201.9 MB in the beginning and 566.8 MB in the end (delta: 364.9 MB). Free memory was 162.3 MB in the beginning and 251.4 MB in the end (delta: -89.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 7.1 GB. [2019-10-07 00:32:51,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 279.12 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 93.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.75 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 93.3 MB in the beginning and 180.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.25 ms. Allocated memory is still 201.9 MB. Free memory was 179.5 MB in the beginning and 163.0 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176964.67 ms. Allocated memory was 201.9 MB in the beginning and 566.8 MB in the end (delta: 364.9 MB). Free memory was 162.3 MB in the beginning and 251.4 MB in the end (delta: -89.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2019-10-07 00:32:51,702 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,703 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,704 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((!(#NULL <= 0) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(0 <= #NULL)) || !(#NULL <= 0)) || ((0 == aa && a == 0) && 0 == \valid[0]) - InvariantResult [Line: 18]: Loop Invariant [2019-10-07 00:32:51,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,707 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,708 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,709 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_71,QUANTIFIED] [2019-10-07 00:32:51,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,712 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,713 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,713 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,713 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,713 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,714 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,715 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 00:32:51,716 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((unknown-#memory_int-unknown[aa][aa + 4 * a] < 0 && 100000 <= i) && 0 == \valid[0]) && a <= 0) && 0 <= x) || ((((((((0 <= unknown-#memory_int-unknown[aa][aa] && 0 == aa) && (forall v_main_~x~0_71 : int :: (v_main_~x~0_71 < 3 || a <= v_main_~x~0_71) || 0 < unknown-#memory_int-unknown[aa][4 * v_main_~x~0_71 + aa] + 1)) && 0 <= x) && 0 <= unknown-#memory_int-unknown[aa][aa + 8]) && unknown-#memory_int-unknown[aa][aa + 4 * a] < 0) && 100000 <= i) && 0 == \valid[0]) && 0 <= unknown-#memory_int-unknown[aa][aa + 4])) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || (((((((0 <= unknown-#memory_int-unknown[aa][aa] && 0 == aa) && unknown-#memory_int-unknown[aa][aa + 4 * a] < 0) && x == 0) && 100000 <= i) && 0 == \valid[0]) && 0 <= unknown-#memory_int-unknown[aa][aa + 4]) && a <= 2)) || !(#NULL <= 0)) || !(0 <= #NULL)) || ((((((unknown-#memory_int-unknown[aa][aa + 4 * a] < 0 && 0 <= unknown-#memory_int-unknown[aa][aa]) && a <= 1) && 0 == aa) && 100000 <= i) && 0 == \valid[0]) && 0 <= x)) || !(0 <= #NULL)) || (((((((0 <= unknown-#memory_int-unknown[aa][aa] && 0 == aa) && unknown-#memory_int-unknown[aa][aa + 4 * a] < 0) && 100000 <= i) && 0 == \valid[0]) && 0 <= unknown-#memory_int-unknown[aa][aa + 4]) && 1 <= x) && a <= 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 176.8s, OverallIterations: 14, TraceHistogramMax: 112, AutomataDifference: 134.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, HoareTripleCheckerStatistics: 162 SDtfs, 631 SDslu, 2073 SDs, 0 SdLazy, 8323 SolverSat, 1869 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 62.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3146 GetRequests, 1767 SyntacticMatches, 19 SemanticMatches, 1360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53817 ImplicationChecksByTransitivity, 100.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 49 PreInvPairs, 194 NumberOfFragments, 622 HoareAnnotationTreeSize, 49 FomulaSimplifications, 15883 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 9789 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 1459 NumberOfCodeBlocks, 1275 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2137 ConstructedInterpolants, 50 QuantifiedInterpolants, 734585 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2212 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 38 InterpolantComputations, 4 PerfectInterpolantSequences, 22225/36771 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2328, ICFG_INTERPRETER_ENTERED_PROCEDURES: 44, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 483, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 272, TOOLS_POST_TIME[ms]: 366, TOOLS_POST_CALL_APPLICATIONS: 119, TOOLS_POST_CALL_TIME[ms]: 216, TOOLS_POST_RETURN_APPLICATIONS: 86, TOOLS_POST_RETURN_TIME[ms]: 47, TOOLS_QUANTIFIERELIM_APPLICATIONS: 477, TOOLS_QUANTIFIERELIM_TIME[ms]: 540, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 41, FLUID_QUERY_TIME[ms]: 13, FLUID_QUERIES: 550, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 368, DOMAIN_JOIN_TIME[ms]: 936, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 38, DOMAIN_WIDEN_TIME[ms]: 204, DOMAIN_ISSUBSETEQ_APPLICATIONS: 67, DOMAIN_ISSUBSETEQ_TIME[ms]: 173, DOMAIN_ISBOTTOM_APPLICATIONS: 61, DOMAIN_ISBOTTOM_TIME[ms]: 101, LOOP_SUMMARIZER_APPLICATIONS: 29, LOOP_SUMMARIZER_CACHE_MISSES: 29, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1093, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1092, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 67, CALL_SUMMARIZER_APPLICATIONS: 86, CALL_SUMMARIZER_CACHE_MISSES: 19, CALL_SUMMARIZER_OVERALL_TIME[ms]: 184, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 183, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 9, PATH_EXPR_TIME[ms]: 9, REGEX_TO_DAG_TIME[ms]: 7, DAG_COMPRESSION_TIME[ms]: 41, DAG_COMPRESSION_PROCESSED_NODES: 1373, DAG_COMPRESSION_RETAINED_NODES: 659, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...