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/rew.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:35,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:35,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:35,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:35,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:35,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:35,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:35,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:35,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:35,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:35,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:35,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:35,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:35,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:35,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:35,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:35,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:35,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:35,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:35,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:35,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:35,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:35,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:35,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:35,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:35,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:35,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:35,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:35,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:35,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:35,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:35,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:35,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:35,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:35,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:35,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:35,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:35,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:35,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:35,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:35,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:35,628 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:35,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:35,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:35,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:35,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:35,666 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:35,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:35,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:35,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:35,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:35,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:35,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:35,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:35,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:35,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:35,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:35,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:35,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:35,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:35,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:35,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:35,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:35,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:35,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:35,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:35,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:35,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:35,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:35,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:35,674 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:35,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:36,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:36,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:36,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:36,017 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:36,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew.c [2019-10-13 21:39:36,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe870e29/d2bfc5768e51426bb2cd61d996186d8c/FLAG3cf76ced6 [2019-10-13 21:39:36,565 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:36,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew.c [2019-10-13 21:39:36,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe870e29/d2bfc5768e51426bb2cd61d996186d8c/FLAG3cf76ced6 [2019-10-13 21:39:36,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe870e29/d2bfc5768e51426bb2cd61d996186d8c [2019-10-13 21:39:36,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:36,953 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:36,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:36,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:36,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:36,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:36" (1/1) ... [2019-10-13 21:39:36,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf90c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:36, skipping insertion in model container [2019-10-13 21:39:36,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:36" (1/1) ... [2019-10-13 21:39:36,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:36,997 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:37,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:37,244 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:37,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:37,275 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:37,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:37 WrapperNode [2019-10-13 21:39:37,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:37,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:37,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:37,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:37,388 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:37" (1/1) ... [2019-10-13 21:39:37,389 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:37" (1/1) ... [2019-10-13 21:39:37,404 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:37" (1/1) ... [2019-10-13 21:39:37,406 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:37" (1/1) ... [2019-10-13 21:39:37,428 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:37" (1/1) ... [2019-10-13 21:39:37,435 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:37" (1/1) ... [2019-10-13 21:39:37,437 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:37" (1/1) ... [2019-10-13 21:39:37,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:37,439 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:37,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:37,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:37,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:37" (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:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:37,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:37,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:39:37,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:37,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:37,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:39:37,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:39:37,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:39:37,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:37,838 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:39:37,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:37 BoogieIcfgContainer [2019-10-13 21:39:37,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:37,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:37,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:37,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:37,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:36" (1/3) ... [2019-10-13 21:39:37,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:37, skipping insertion in model container [2019-10-13 21:39:37,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:37" (2/3) ... [2019-10-13 21:39:37,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29061e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:37, skipping insertion in model container [2019-10-13 21:39:37,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:37" (3/3) ... [2019-10-13 21:39:37,860 INFO L109 eAbstractionObserver]: Analyzing ICFG rew.c [2019-10-13 21:39:37,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:37,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:37,886 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:37,911 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:37,912 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:37,912 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:37,912 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:37,912 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:37,912 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:37,913 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:37,913 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:39:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:39:37,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:37,938 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:37,940 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1799181545, now seen corresponding path program 1 times [2019-10-13 21:39:37,951 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:37,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788194911] [2019-10-13 21:39:37,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:37,952 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:38,129 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:38,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788194911] [2019-10-13 21:39:38,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:39:38,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:39:38,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636514319] [2019-10-13 21:39:38,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:39:38,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:38,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:39:38,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:39:38,150 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:39:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:38,220 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-13 21:39:38,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:39:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:39:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:38,230 INFO L225 Difference]: With dead ends: 34 [2019-10-13 21:39:38,231 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:39:38,234 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:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:39:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:39:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:39:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-13 21:39:38,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-13 21:39:38,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:38,275 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-13 21:39:38,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:39:38,275 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-13 21:39:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:39:38,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:38,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:38,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -623938133, now seen corresponding path program 1 times [2019-10-13 21:39:38,278 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:38,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770655713] [2019-10-13 21:39:38,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:38,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:38,357 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:38,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770655713] [2019-10-13 21:39:38,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400467427] [2019-10-13 21:39:38,358 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:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:38,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:39:38,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:38,480 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:38,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:38,548 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:38,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1333431695] [2019-10-13 21:39:38,573 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:39:38,573 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:38,579 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:38,586 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:38,586 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:38,853 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:39,571 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-13 21:39:39,586 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:39,594 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:39,595 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:39,595 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 102#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 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)) (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_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:39,596 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 87#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) |main_#t~mem5|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:39,596 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 111#(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:39,596 INFO L193 IcfgInterpreter]: Reachable states at location L14 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:39,597 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 107#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (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) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 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)) (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_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:39,597 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 97#(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) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 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)) (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:39,598 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:39,598 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:39,599 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 116#(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:39,599 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:39,599 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 82#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:39,600 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 77#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~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|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= main_~val1~0 0) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= 2 main_~low~0) (<= ~SIZE~0 2147483647) (= main_~val1~0 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (<= main_~low~0 2) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:39,600 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 92#(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) (<= v_main_~a~0.offset_BEFORE_CALL_1 0) (<= ~SIZE~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (not (<= 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)) (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:40,219 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 32 [2019-10-13 21:39:40,361 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-10-13 21:39:40,524 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-10-13 21:39:40,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:40,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:39:40,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942123218] [2019-10-13 21:39:40,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:39:40,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:39:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:39:40,618 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2019-10-13 21:39:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:41,298 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-10-13 21:39:41,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:39:41,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-10-13 21:39:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:41,301 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:39:41,301 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 21:39:41,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:39:41,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 21:39:41,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2019-10-13 21:39:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:39:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 21:39:41,313 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 21:39:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:41,315 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 21:39:41,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:39:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 21:39:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:39:41,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:41,316 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:41,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:41,522 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1448869271, now seen corresponding path program 2 times [2019-10-13 21:39:41,524 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:41,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428951370] [2019-10-13 21:39:41,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:41,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:41,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:41,784 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:41,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428951370] [2019-10-13 21:39:41,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487288716] [2019-10-13 21:39:41,785 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:41,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:39:41,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:39:41,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:39:41,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:43,598 WARN L191 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-13 21:39:43,704 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:43,704 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:43,893 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:43,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1061955975] [2019-10-13 21:39:43,895 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:39:43,895 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:43,896 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:43,896 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:43,896 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:43,950 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:44,337 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-13 21:39:44,353 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:44,363 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:44,364 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:44,364 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 91#(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:44,365 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 76#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (< main_~i~0 ~SIZE~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) |main_#t~mem5|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:44,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 100#(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:44,365 INFO L193 IcfgInterpreter]: Reachable states at location L14 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:44,366 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 96#(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:44,366 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 86#(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:44,366 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:44,366 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:44,367 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 105#(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:44,367 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:44,367 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 71#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) [2019-10-13 21:39:44,368 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 66#(and (or (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3)) (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~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|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= main_~val1~0 0) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= 2 main_~low~0) (<= ~SIZE~0 2147483647) (= main_~val1~0 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= ~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|) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (<= main_~low~0 2) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0))) (<= 100000 ~MAX~0)) [2019-10-13 21:39:44,368 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 81#(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:44,975 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 31 [2019-10-13 21:39:45,277 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-10-13 21:39:45,411 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:45,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 32 [2019-10-13 21:39:45,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832754895] [2019-10-13 21:39:45,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:39:45,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:39:45,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:39:45,414 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 32 states. [2019-10-13 21:39:48,426 WARN L191 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-13 21:39:50,276 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-10-13 21:39:52,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:52,763 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-10-13 21:39:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:39:52,766 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 14 [2019-10-13 21:39:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:52,769 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:39:52,769 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:39:52,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=227, Invalid=1579, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 21:39:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:39:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-10-13 21:39:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:39:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-13 21:39:52,781 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2019-10-13 21:39:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:52,783 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-13 21:39:52,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:39:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-13 21:39:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:39:52,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:52,786 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:52,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:52,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:52,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1296602369, now seen corresponding path program 1 times [2019-10-13 21:39:52,991 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:52,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800260606] [2019-10-13 21:39:52,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:52,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:52,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:53,125 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:53,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800260606] [2019-10-13 21:39:53,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554780625] [2019-10-13 21:39:53,126 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:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:53,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-13 21:39:53,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:53,456 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,456 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:55,047 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:55,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2141646861] [2019-10-13 21:39:55,049 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:39:55,050 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:55,050 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:55,050 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:55,050 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:55,081 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-13 21:39:56,974 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 77 for LOIs [2019-10-13 21:39:56,986 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 16 for LOIs [2019-10-13 21:39:56,990 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:56,990 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:56,991 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 490#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0))))) [2019-10-13 21:39:56,991 INFO L193 IcfgInterpreter]: Reachable states at location L33 satisfy 314#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 0) (<= 100000 ~MAX~0) (= |#NULL.base| 0) (<= 3 main_~val2~0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= main_~i~0 100000) (<= 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_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:39:56,991 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 499#(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:56,992 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 485#(and (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0))))) [2019-10-13 21:39:56,992 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 480#(and (not (= 0 __VERIFIER_assert_~cond)) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0))))) [2019-10-13 21:39:56,992 INFO L193 IcfgInterpreter]: Reachable states at location L14 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:56,993 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 495#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0))))) [2019-10-13 21:39:56,993 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 475#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0))))) [2019-10-13 21:39:56,993 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:56,994 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:56,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 504#(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:56,994 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:56,994 INFO L193 IcfgInterpreter]: Reachable states at location L31-3 satisfy 393#(and (and (= |old(~SIZE~0)| 0) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (= main_~val1~0 0) (= |#NULL.base| 0) (= main_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3)) (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) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= main_~val1~0 0) (<= 0 |main_#t~malloc2.offset|) (<= 0 |old(~SIZE~0)|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 2 main_~low~0) (<= main_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~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) (<= main_~a~0.offset 0) (<= main_~val2~0 3) (<= 0 main_~a~0.offset) (<= 0 |#NULL.base|) (<= main_~val1~0 0) (<= 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) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:56,995 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 77#(and (or (and (<= ~MAX~0 100000) (= |old(~SIZE~0)| 0) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~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|) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= main_~val1~0 0) (= |#valid| (store |old(#valid)| |main_#t~malloc2.base| 1)) (<= 0 |#NULL.offset|) (= main_~a~0.offset |main_#t~malloc2.offset|) (<= 2 main_~low~0) (<= ~SIZE~0 2147483647) (= main_~val1~0 0) (< |#StackHeapBarrier| |main_#t~malloc2.base|) (<= 3 main_~val2~0) (<= ~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|) (<= main_~i~0 0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= 0 |old(~SIZE~0)|) (= (select |old(#valid)| |main_#t~malloc2.base|) 0) (<= main_~low~0 2) (= |main_#t~malloc2.base| main_~a~0.base) (= main_~low~0 2) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~val2~0 3) (= main_~i~0 0)) (and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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_~low~0 2) (= |#NULL.offset| 0) (= main_~val2~0 3))) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (<= 100000 ~MAX~0)) [2019-10-13 21:39:56,995 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 470#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (v_prenex_17 Int) (v_prenex_12 Int) (v_main_~a~0.offset_BEFORE_CALL_13 Int) (v_prenex_11 Int) (v_main_~a~0.base_BEFORE_CALL_13 Int) (v_prenex_14 Int) (v_prenex_13 Int) (v_main_~i~0_BEFORE_CALL_13 Int)) (or (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_prenex_17) (<= 0 v_prenex_17) (<= v_prenex_17 0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_11) (<= 0 |#NULL.base|) (<= v_prenex_11 0) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (< (select (select |#memory_int| v_prenex_12) v_prenex_11) 2) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 100000) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 0) (<= ~SIZE~0 100000) (< v_main_~i~0_BEFORE_CALL_13 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (< (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_13) (+ v_main_~a~0.offset_BEFORE_CALL_13 (* v_main_~i~0_BEFORE_CALL_13 4))) 2) (<= 0 v_main_~i~0_BEFORE_CALL_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_main_~a~0.offset_BEFORE_CALL_13 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 1 v_main_~i~0_BEFORE_CALL_13) (= |#NULL.offset| 0) (<= 0 v_main_~a~0.offset_BEFORE_CALL_13) (<= v_main_~i~0_BEFORE_CALL_13 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (< v_prenex_17 ~SIZE~0) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_15) (<= 2 (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 (* v_prenex_17 4)))) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= v_prenex_15 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_17 100000) (<= 1 v_prenex_17) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)) (and (= |#NULL.base| 0) (<= ~MAX~0 100000) (= |__VERIFIER_assert_#in~cond| 1) (<= ~SIZE~0 100000) (<= 2 (select (select |#memory_int| v_prenex_14) v_prenex_13)) (<= |#NULL.base| 0) (<= 1 ~SIZE~0) (<= 0 v_prenex_13) (<= 0 |#NULL.base|) (= ~MAX~0 100000) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= v_prenex_13 0) (< 0 ~SIZE~0) (= |#NULL.offset| 0) (<= 100000 ~MAX~0)))) [2019-10-13 21:39:56,995 INFO L193 IcfgInterpreter]: Reachable states at location L33-1 satisfy 466#(and (= |old(~SIZE~0)| 0) (<= ~MAX~0 100000) (<= |main_#t~malloc2.offset| 0) (<= 0 main_~i~0) (<= main_~val2~0 3) (<= 0 |#NULL.base|) (= |main_#t~malloc2.offset| 0) (= ~MAX~0 100000) (<= main_~val1~0 0) (<= 0 |#NULL.offset|) (<= 2 main_~low~0) (= main_~val1~0 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 2) (= main_~low~0 2) (<= |old(~SIZE~0)| 0) (<= 0 main_~val1~0) (= |#NULL.offset| 0) (= main_~val2~0 3)) [2019-10-13 21:39:59,694 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 32 [2019-10-13 21:40:00,452 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:40:00,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10, 12] total 39 [2019-10-13 21:40:00,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686660347] [2019-10-13 21:40:00,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:40:00,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:40:00,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:40:00,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1356, Unknown=1, NotChecked=0, Total=1482 [2019-10-13 21:40:00,457 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 39 states. [2019-10-13 21:40:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:40:18,152 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2019-10-13 21:40:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:40:18,152 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 21 [2019-10-13 21:40:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:40:18,155 INFO L225 Difference]: With dead ends: 65 [2019-10-13 21:40:18,155 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 21:40:18,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=469, Invalid=4084, Unknown=3, NotChecked=0, Total=4556 [2019-10-13 21:40:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 21:40:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2019-10-13 21:40:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:40:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-10-13 21:40:18,176 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 21 [2019-10-13 21:40:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:40:18,177 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-10-13 21:40:18,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:40:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-10-13 21:40:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 21:40:18,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:40:18,179 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:40:18,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:40:18,386 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:40:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:40:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1478277397, now seen corresponding path program 2 times [2019-10-13 21:40:18,387 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:40:18,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477490213] [2019-10-13 21:40:18,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:18,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:40:18,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:40:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:40:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:40:18,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477490213] [2019-10-13 21:40:18,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886521375] [2019-10-13 21:40:18,561 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:18,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:40:18,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:40:18,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 21:40:18,640 INFO L279 TraceCheckSpWp]: Computing forward predicates...