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-tiling/rewrev.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:41,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:41,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:41,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:41,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:41,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:41,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:41,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:41,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:41,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:41,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:41,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:41,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:41,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:41,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:41,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:41,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:41,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:41,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:41,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:41,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:41,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:41,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:41,646 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:41,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:41,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:41,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:41,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:41,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:41,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:41,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:41,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:41,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:41,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:41,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:41,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:41,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:41,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:41,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:41,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:41,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:41,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:39:41,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:41,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:41,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:41,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:41,675 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:41,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:41,675 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:41,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:41,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:41,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:41,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:41,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:41,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:41,676 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:41,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:41,677 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:41,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:41,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:41,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:41,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:41,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:41,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:41,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:41,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:41,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:41,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:41,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:41,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:41,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:39:41,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:42,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:42,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:42,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:42,011 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:42,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rewrev.c [2019-10-13 21:39:42,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744880583/70514f61f4d74b209fd88f7f64607751/FLAGeeab6c5aa [2019-10-13 21:39:42,583 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:42,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rewrev.c [2019-10-13 21:39:42,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744880583/70514f61f4d74b209fd88f7f64607751/FLAGeeab6c5aa [2019-10-13 21:39:42,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744880583/70514f61f4d74b209fd88f7f64607751 [2019-10-13 21:39:42,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:42,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:42,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:42,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:42,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:42,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:42" (1/1) ... [2019-10-13 21:39:42,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc683dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:42, skipping insertion in model container [2019-10-13 21:39:42,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:42" (1/1) ... [2019-10-13 21:39:42,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:42,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:43,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:43,258 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:43,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:43,303 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:43,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43 WrapperNode [2019-10-13 21:39:43,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:43,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:43,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:43,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:43,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... [2019-10-13 21:39:43,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:43,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:43,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:43,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:43,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:39:43,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:39:43,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:43,894 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:39:43,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:43 BoogieIcfgContainer [2019-10-13 21:39:43,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:43,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:43,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:43,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:43,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:42" (1/3) ... [2019-10-13 21:39:43,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ff02e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:43, skipping insertion in model container [2019-10-13 21:39:43,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:43" (2/3) ... [2019-10-13 21:39:43,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ff02e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:43, skipping insertion in model container [2019-10-13 21:39:43,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:43" (3/3) ... [2019-10-13 21:39:43,904 INFO L109 eAbstractionObserver]: Analyzing ICFG rewrev.c [2019-10-13 21:39:43,916 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:43,924 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:43,935 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:43,958 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:43,959 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:43,959 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:43,959 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:43,959 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:43,959 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:43,959 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:43,959 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:43,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:39:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:39:43,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:43,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:43,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:43,990 INFO L82 PathProgramCache]: Analyzing trace with hash 698834392, now seen corresponding path program 1 times [2019-10-13 21:39:43,998 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:43,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422978603] [2019-10-13 21:39:43,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:44,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422978603] [2019-10-13 21:39:44,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:39:44,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:39:44,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374312378] [2019-10-13 21:39:44,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:39:44,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:39:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:39:44,229 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:39:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:44,273 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-13 21:39:44,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:39:44,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:39:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:44,283 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:39:44,283 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:39:44,286 INFO L600 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-13 21:39:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:39:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:39:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:39:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-13 21:39:44,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-13 21:39:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:44,321 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-13 21:39:44,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:39:44,321 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-13 21:39:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:39:44,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:44,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:44,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash -494855414, now seen corresponding path program 1 times [2019-10-13 21:39:44,323 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:44,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519589636] [2019-10-13 21:39:44,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:44,400 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-13 21:39:44,401 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519589636] [2019-10-13 21:39:44,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814002115] [2019-10-13 21:39:44,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:44,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:39:44,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:44,521 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-13 21:39:44,522 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:44,541 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-13 21:39:44,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1528866326] [2019-10-13 21:39:44,564 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:39:44,565 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:44,572 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:44,579 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:44,580 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:44,845 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:45,501 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-13 21:39:45,523 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:45,534 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:45,535 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:45,536 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~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-13 21:39:45,537 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:39:45,537 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= ~SIZE~0 2147483647) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-13 21:39:45,538 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 85#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:45,538 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:45,539 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:45,539 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 70#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:45,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:45,540 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:45,543 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* ~SIZE~0 4)) |#length|) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= 0 (+ ~SIZE~0 2147483648)) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:45,544 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:45,546 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1))) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) v_main_~a~0.offset_BEFORE_CALL_1)) (<= 0 v_main_~a~0.offset_BEFORE_CALL_1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~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-13 21:39:45,546 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 75#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) |main_#t~mem5|) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:46,085 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 34 [2019-10-13 21:39:46,212 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 32 [2019-10-13 21:39:46,370 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-10-13 21:39:46,455 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:46,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 15 [2019-10-13 21:39:46,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53305250] [2019-10-13 21:39:46,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:39:46,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:39:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:39:46,462 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 15 states. [2019-10-13 21:39:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:46,981 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-10-13 21:39:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:39:46,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 13 [2019-10-13 21:39:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:46,989 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:39:46,990 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 21:39:46,991 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:39:46,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 21:39:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2019-10-13 21:39:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:39:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 21:39:47,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 21:39:47,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:47,011 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 21:39:47,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:39:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 21:39:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:39:47,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:47,014 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:47,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:47,220 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1155466264, now seen corresponding path program 2 times [2019-10-13 21:39:47,221 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:47,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256050729] [2019-10-13 21:39:47,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:47,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:47,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:47,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256050729] [2019-10-13 21:39:47,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700027882] [2019-10-13 21:39:47,463 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:47,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:39:47,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:39:47,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 21:39:47,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:47,718 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:47,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [307655398] [2019-10-13 21:39:47,887 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:39:47,887 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:47,887 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:47,888 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:47,888 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:47,937 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:48,362 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-13 21:39:48,376 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:48,384 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:48,385 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:48,385 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 90#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:48,385 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:39:48,385 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-13 21:39:48,386 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 85#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:48,386 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:48,387 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:48,387 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 70#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:48,387 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:48,388 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:48,388 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* ~SIZE~0 4)) |#length|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:48,388 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:48,389 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (v_main_~a~0.offset_BEFORE_CALL_2 Int)) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= v_main_~a~0.offset_BEFORE_CALL_2 0) (<= 2 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) v_main_~a~0.offset_BEFORE_CALL_2)) (<= 100000 ~MAX~0)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:48,390 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 75#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) |main_#t~mem5|) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:49,148 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 35 [2019-10-13 21:39:49,451 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-10-13 21:39:49,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:49,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 32 [2019-10-13 21:39:49,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761533429] [2019-10-13 21:39:49,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:39:49,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:39:49,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:39:49,564 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 32 states. [2019-10-13 21:39:49,924 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-10-13 21:39:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:50,846 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-13 21:39:50,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:39:50,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 14 [2019-10-13 21:39:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:50,849 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:39:50,849 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:39:50,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 21:39:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:39:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2019-10-13 21:39:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:39:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-13 21:39:50,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2019-10-13 21:39:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:50,859 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-13 21:39:50,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:39:50,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-13 21:39:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:39:50,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:50,861 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:51,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:51,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:51,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1734055745, now seen corresponding path program 1 times [2019-10-13 21:39:51,073 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:51,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724418465] [2019-10-13 21:39:51,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:51,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:51,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:51,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724418465] [2019-10-13 21:39:51,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070952403] [2019-10-13 21:39:51,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:51,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 21:39:51,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:53,887 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:39:54,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1455284945] [2019-10-13 21:39:54,189 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:39:54,190 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:54,190 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:54,190 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:54,191 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:54,225 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:54,799 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 21:39:54,846 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:54,851 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:54,851 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:54,852 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,852 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 197#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:39:54,852 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 183#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,852 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,853 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 178#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,853 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 173#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:54,853 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,853 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,854 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 163#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:54,854 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 202#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,854 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:54,854 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* ~SIZE~0 4)) |#length|) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= 0 (+ ~SIZE~0 2147483648)) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,855 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 168#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:54,855 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-13 21:39:54,855 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 154#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:39:54,856 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:39:57,835 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-13 21:39:58,436 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:58,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 12] total 39 [2019-10-13 21:39:58,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539532078] [2019-10-13 21:39:58,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:39:58,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:39:58,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1328, Unknown=1, NotChecked=0, Total=1482 [2019-10-13 21:39:58,441 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 39 states. [2019-10-13 21:40:04,996 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-10-13 21:40:05,189 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-10-13 21:40:05,480 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-13 21:40:06,194 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-13 21:40:07,187 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-10-13 21:40:07,389 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-10-13 21:40:09,840 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-10-13 21:40:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:09,845 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-13 21:40:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:40:09,847 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 21 [2019-10-13 21:40:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:09,849 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:40:09,849 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:40:09,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=425, Invalid=3114, Unknown=1, NotChecked=0, Total=3540 [2019-10-13 21:40:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:40:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-10-13 21:40:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:40:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-10-13 21:40:09,863 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 21 [2019-10-13 21:40:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:09,864 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-10-13 21:40:09,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:40:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-10-13 21:40:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:40:09,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:09,866 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:10,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:10,071 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 648727096, now seen corresponding path program 2 times [2019-10-13 21:40:10,071 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:10,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430097705] [2019-10-13 21:40:10,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:10,072 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:10,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:10,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:10,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430097705] [2019-10-13 21:40:10,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139579890] [2019-10-13 21:40:10,157 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:10,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:40:10,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:40:10,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 21:40:10,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:10,266 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:40:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:10,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1215240834] [2019-10-13 21:40:10,327 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:40:10,327 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:40:10,327 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:40:10,328 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:40:10,328 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:40:10,357 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 32 for LOIs [2019-10-13 21:40:10,842 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 23 for LOIs [2019-10-13 21:40:10,886 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:40:10,889 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:40:10,889 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 197#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~SIZE~0)| ~SIZE~0)) [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 183#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 38#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (<= ~SIZE~0 2147483647) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 178#(and (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,890 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 173#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:40:10,891 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |#valid| 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,891 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= |#valid| |old(#valid)|) (<= |old(~SIZE~0)| 0) (<= 0 ~SIZE~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= ~SIZE~0 0) (= |old(~SIZE~0)| ~SIZE~0) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,891 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 163#(and (or (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (<= 1 main_~i~0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 7) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (or (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= main_~i~0 0) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 7 main_~val1~0) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 main_~i~0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= main_~val1~0 7) (<= |old(~SIZE~0)| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:40:10,891 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 202#(and (<= ~MAX~0 100000) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= ~SIZE~0 0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~SIZE~0) (= |#NULL.offset| 0) (<= ~SIZE~0 0) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,892 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:40:10,892 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 65#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (= 0 |#NULL.base|) (= (store |old(#length)| |main_#t~malloc2.base| (* ~SIZE~0 4)) |#length|) (<= 7 main_~val1~0) (<= main_~i~0 99998) (< ~SIZE~0 ~MAX~0) (< 1 ~SIZE~0) (= 0 |main_#t~malloc2.offset|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= 2 main_~low~0) (<= ~SIZE~0 2147483647) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= 0 (+ main_~i~0 1)) (<= ~SIZE~0 100000) (not (= |main_#t~malloc2.base| 0)) (<= |#NULL.base| 0) (<= 0 (+ ~SIZE~0 2147483648)) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= 0 (select |old(#valid)| 0)) (= main_~i~0 (+ ~SIZE~0 (- 2))) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (<= main_~low~0 2) (= |main_#t~malloc2.base| main_~a~0.base) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 7 main_~val1~0) (<= main_~i~0 99998) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,892 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 193#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (or (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (<= ~MAX~0 100000) (= |#NULL.base| 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 0 __VERIFIER_assert_~cond) (<= 100000 ~MAX~0)) [2019-10-13 21:40:10,893 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 168#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= ~MAX~0 100000) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= ~MAX~0 100000) (= |#NULL.offset| 0))) (or (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (<= ~MAX~0 100000) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:40:10,893 INFO L193 IcfgInterpreter]: Reachable states at location L32-1 satisfy 154#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 2 |main_#t~mem5|) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 |main_#t~mem5|) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:40:10,893 INFO L193 IcfgInterpreter]: Reachable states at location L32 satisfy 142#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= 7 main_~val1~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (= main_~val1~0 7) (<= 2 main_~low~0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~a~0.offset 0) (<= 0 main_~a~0.offset) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= |#NULL.offset| 0) (<= main_~low~0 2) (<= main_~val1~0 7) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:40:11,399 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-10-13 21:40:11,744 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-10-13 21:40:12,224 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:40:12,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 12] total 27 [2019-10-13 21:40:12,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178296207] [2019-10-13 21:40:12,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 21:40:12,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 21:40:12,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:40:12,228 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 27 states. [2019-10-13 21:40:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:13,914 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-10-13 21:40:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 21:40:13,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2019-10-13 21:40:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:13,918 INFO L225 Difference]: With dead ends: 66 [2019-10-13 21:40:13,918 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:40:13,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=366, Invalid=1796, Unknown=0, NotChecked=0, Total=2162 [2019-10-13 21:40:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:40:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 21:40:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:40:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-10-13 21:40:13,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2019-10-13 21:40:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:13,931 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-10-13 21:40:13,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 21:40:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-10-13 21:40:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:40:13,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:13,933 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:14,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:14,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash 932701034, now seen corresponding path program 3 times [2019-10-13 21:40:14,138 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:14,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300491627] [2019-10-13 21:40:14,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:14,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:14,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:40:14,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300491627] [2019-10-13 21:40:14,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679517910] [2019-10-13 21:40:14,457 INFO L92 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 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-13 21:40:14,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:40:14,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:40:14,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 21:40:14,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:40:14,770 WARN L225 Elim1Store]: Array PQE input equivalent to false