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/pr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:39:13,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:39:13,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:39:13,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:39:13,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:39:13,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:39:13,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:39:13,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:39:13,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:39:13,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:39:13,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:39:13,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:39:13,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:39:13,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:39:13,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:39:13,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:39:13,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:39:13,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:39:13,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:39:13,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:39:13,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:39:13,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:39:13,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:39:13,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:39:13,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:39:13,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:39:13,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:39:13,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:39:13,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:39:13,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:39:13,702 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:39:13,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:39:13,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:39:13,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:39:13,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:39:13,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:39:13,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:39:13,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:39:13,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:39:13,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:39:13,709 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:39:13,710 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:13,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:39:13,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:39:13,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:39:13,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:39:13,733 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:39:13,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:39:13,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:39:13,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:39:13,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:39:13,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:39:13,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:39:13,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:39:13,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:39:13,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:39:13,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:39:13,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:39:13,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:39:13,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:39:13,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:39:13,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:39:13,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:39:13,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:39:13,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:39:13,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:39:13,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:39:13,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:39:13,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:39:13,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:39:13,740 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:14,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:39:14,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:39:14,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:39:14,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:39:14,087 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:39:14,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr2.c [2019-10-13 21:39:14,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd664a23a/2287153a50b34f67b0bfbabd90b44142/FLAG696e09dc9 [2019-10-13 21:39:14,569 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:39:14,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr2.c [2019-10-13 21:39:14,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd664a23a/2287153a50b34f67b0bfbabd90b44142/FLAG696e09dc9 [2019-10-13 21:39:14,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd664a23a/2287153a50b34f67b0bfbabd90b44142 [2019-10-13 21:39:14,945 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:39:14,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:39:14,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:14,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:39:14,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:39:14,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:14" (1/1) ... [2019-10-13 21:39:14,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62309fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:14, skipping insertion in model container [2019-10-13 21:39:14,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:39:14" (1/1) ... [2019-10-13 21:39:14,963 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:39:14,982 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:39:15,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:15,170 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:39:15,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:39:15,211 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:39:15,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:15 WrapperNode [2019-10-13 21:39:15,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:39:15,212 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:39:15,212 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:39:15,212 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:39:15,308 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:15" (1/1) ... [2019-10-13 21:39:15,308 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:15" (1/1) ... [2019-10-13 21:39:15,317 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:15" (1/1) ... [2019-10-13 21:39:15,317 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:15" (1/1) ... [2019-10-13 21:39:15,325 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:15" (1/1) ... [2019-10-13 21:39:15,330 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:15" (1/1) ... [2019-10-13 21:39:15,332 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:15" (1/1) ... [2019-10-13 21:39:15,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:39:15,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:39:15,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:39:15,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:39:15,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:15" (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:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:39:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:39:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:39:15,386 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:39:15,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:39:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:39:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:39:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:39:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:39:15,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:39:15,837 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:39:15,837 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 21:39:15,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:15 BoogieIcfgContainer [2019-10-13 21:39:15,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:39:15,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:39:15,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:39:15,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:39:15,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:39:14" (1/3) ... [2019-10-13 21:39:15,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2fffc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:15, skipping insertion in model container [2019-10-13 21:39:15,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:39:15" (2/3) ... [2019-10-13 21:39:15,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2fffc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:39:15, skipping insertion in model container [2019-10-13 21:39:15,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:39:15" (3/3) ... [2019-10-13 21:39:15,846 INFO L109 eAbstractionObserver]: Analyzing ICFG pr2.c [2019-10-13 21:39:15,854 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:39:15,860 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:39:15,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:39:15,894 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:39:15,895 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:39:15,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:39:15,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:39:15,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:39:15,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:39:15,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:39:15,896 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:39:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-13 21:39:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:39:15,918 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:15,919 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:15,921 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1554635187, now seen corresponding path program 1 times [2019-10-13 21:39:15,935 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:15,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652738755] [2019-10-13 21:39:15,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:15,936 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:15,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:16,153 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:16,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652738755] [2019-10-13 21:39:16,155 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:39:16,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:39:16,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277514043] [2019-10-13 21:39:16,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:39:16,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:39:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:39:16,180 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-13 21:39:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:16,302 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-13 21:39:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:39:16,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 21:39:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:16,318 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:39:16,319 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:39:16,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:39:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:39:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:39:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:39:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 21:39:16,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 21:39:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:16,382 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 21:39:16,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:39:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 21:39:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:39:16,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:16,385 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:16,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash 3214725, now seen corresponding path program 1 times [2019-10-13 21:39:16,388 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:16,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524955912] [2019-10-13 21:39:16,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:16,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:16,855 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:16,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524955912] [2019-10-13 21:39:16,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722677448] [2019-10-13 21:39:16,856 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:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:16,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-13 21:39:16,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:17,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,089 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:17,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,219 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-10-13 21:39:17,220 INFO L567 ElimStorePlain]: treesize reduction 3, result has 96.3 percent of original size [2019-10-13 21:39:17,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:17,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2019-10-13 21:39:17,250 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:17,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:17,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:17,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2019-10-13 21:39:17,320 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:17,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:17,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 21:39:17,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2019-10-13 21:39:17,398 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:17,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-13 21:39:17,445 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:111, output treesize:80 [2019-10-13 21:39:17,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 21:39:17,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,662 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:17,662 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:17,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-10-13 21:39:17,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-10-13 21:39:17,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,835 INFO L567 ElimStorePlain]: treesize reduction 12, result has 53.8 percent of original size [2019-10-13 21:39:17,835 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 21:39:17,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-10-13 21:39:17,878 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,884 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-10-13 21:39:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:17,892 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,903 INFO L567 ElimStorePlain]: treesize reduction 12, result has 53.8 percent of original size [2019-10-13 21:39:17,904 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:17,972 INFO L567 ElimStorePlain]: treesize reduction 25, result has 80.2 percent of original size [2019-10-13 21:39:17,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2019-10-13 21:39:17,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 21:39:17,999 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-10-13 21:39:18,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:18,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:39:18,002 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 21:39:18,010 INFO L567 ElimStorePlain]: treesize reduction 13, result has 38.1 percent of original size [2019-10-13 21:39:18,011 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:18,022 INFO L567 ElimStorePlain]: treesize reduction 52, result has 13.3 percent of original size [2019-10-13 21:39:18,023 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-10-13 21:39:18,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 21:39:18,024 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:206, output treesize:8 [2019-10-13 21:39:18,060 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:18,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [600811143] [2019-10-13 21:39:18,110 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:39:18,110 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:18,119 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:18,131 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:18,132 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:18,323 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:18,729 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:18,921 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 150 [2019-10-13 21:39:18,937 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,184 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-13 21:39:19,226 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,377 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-10-13 21:39:19,391 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,405 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,419 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,523 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-10-13 21:39:19,759 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,827 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,836 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,845 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,913 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:19,942 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:20,094 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-13 21:39:20,113 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:20,120 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:20,121 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:20,121 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:20,121 INFO L193 IcfgInterpreter]: Reachable states at location L45-2 satisfy 127#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0)) [2019-10-13 21:39:20,122 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 142#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:20,122 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 151#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:20,123 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 137#(and (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:20,123 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:20,124 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:20,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 156#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:20,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:20,126 INFO L193 IcfgInterpreter]: Reachable states at location L43-3 satisfy 119#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= main_~i~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0)) [2019-10-13 21:39:20,126 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:20,126 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 114#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (<= |main_~#volArray~0.offset| 0) (not (= 0 (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) 1 0))) (= 0 |#NULL.base|) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) (= |main_~#volArray~0.offset| 0) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0))) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:20,127 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 132#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:20,127 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 147#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (not (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 0))) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (< 0 ~CELLCOUNT~0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:39:20,957 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:20,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 11] total 29 [2019-10-13 21:39:20,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053819114] [2019-10-13 21:39:20,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:39:20,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:39:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:39:20,963 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 29 states. [2019-10-13 21:39:21,565 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-13 21:39:22,045 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-10-13 21:39:22,219 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-10-13 21:39:22,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:22,411 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-10-13 21:39:22,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:39:22,412 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 14 [2019-10-13 21:39:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:22,414 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:39:22,414 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:39:22,419 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:39:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:39:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-13 21:39:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 21:39:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-13 21:39:22,437 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2019-10-13 21:39:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:22,437 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-13 21:39:22,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:39:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-13 21:39:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:39:22,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:22,440 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:22,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:22,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1342289861, now seen corresponding path program 1 times [2019-10-13 21:39:22,645 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:22,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502906942] [2019-10-13 21:39:22,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:22,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:22,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:22,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502906942] [2019-10-13 21:39:22,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495653012] [2019-10-13 21:39:22,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:22,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:39:22,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:23,203 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:23,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [35281019] [2019-10-13 21:39:23,298 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:23,299 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:23,299 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:23,299 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:23,300 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:23,350 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:39:23,652 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:23,803 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:23,943 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,033 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,045 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,059 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,268 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,310 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,375 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,384 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,392 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:24,418 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:25,491 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:25,525 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:25,528 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:25,528 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:25,528 INFO L193 IcfgInterpreter]: Reachable states at location L45-2 satisfy 328#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= main_~i~0 2147483647) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:25,529 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:25,529 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 467#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,529 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 476#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:25,529 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 462#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,530 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 457#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,530 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 452#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:25,530 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,530 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~CELLCOUNT~0)|) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:25,531 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 481#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,531 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:25,531 INFO L193 IcfgInterpreter]: Reachable states at location L43-3 satisfy 388#(and (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (or (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)))) [2019-10-13 21:39:25,531 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 114#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (not (= 0 (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) 1 0))) (= 0 |#NULL.base|) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) (= |main_~#volArray~0.offset| 0) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0))) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:25,531 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:25,532 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 447#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:25,532 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 472#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:25,532 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 443#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:26,005 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-13 21:39:26,659 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:26,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7, 13] total 32 [2019-10-13 21:39:26,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744937348] [2019-10-13 21:39:26,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-13 21:39:26,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:26,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-13 21:39:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=860, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:39:26,662 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 32 states. [2019-10-13 21:39:26,911 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-13 21:39:27,634 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-13 21:39:28,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:28,523 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-13 21:39:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:39:28,523 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 28 [2019-10-13 21:39:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:28,525 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:39:28,525 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 21:39:28,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=339, Invalid=2111, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 21:39:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 21:39:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-13 21:39:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-13 21:39:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-13 21:39:28,540 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 28 [2019-10-13 21:39:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:28,541 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-13 21:39:28,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-13 21:39:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-13 21:39:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:39:28,542 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:28,545 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:28,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:28,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:28,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1527019917, now seen corresponding path program 2 times [2019-10-13 21:39:28,756 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:28,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677589803] [2019-10-13 21:39:28,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:28,757 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:28,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677589803] [2019-10-13 21:39:28,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728597768] [2019-10-13 21:39:28,999 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 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:29,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:39:29,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:39:29,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 21:39:29,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:29,164 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:29,993 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:39:30,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643321436] [2019-10-13 21:39:30,165 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:30,165 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:30,165 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:30,166 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:30,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:30,188 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:30,418 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:30,612 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 150 [2019-10-13 21:39:30,633 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:30,822 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-10-13 21:39:30,844 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:30,864 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:30,879 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,029 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-13 21:39:31,048 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,318 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-10-13 21:39:31,405 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,558 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,675 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,709 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,717 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:31,725 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:32,689 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:32,744 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:32,748 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:32,748 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:32,748 INFO L193 IcfgInterpreter]: Reachable states at location L45-2 satisfy 328#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= main_~i~0 2147483647) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:32,749 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:32,749 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 467#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,749 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 476#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:32,749 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 462#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 457#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 452#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:32,750 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,750 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:32,750 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 481#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,751 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:32,751 INFO L193 IcfgInterpreter]: Reachable states at location L43-3 satisfy 388#(and (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (or (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)))) [2019-10-13 21:39:32,751 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 114#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (<= |main_~#volArray~0.offset| 0) (not (= 0 (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) 1 0))) (= 0 |#NULL.base|) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) (= |main_~#volArray~0.offset| 0) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0))) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:32,751 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:32,752 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 447#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:32,754 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 472#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:32,755 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 443#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:33,496 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-13 21:39:33,917 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-10-13 21:39:34,494 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:34,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11, 13] total 38 [2019-10-13 21:39:34,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485019194] [2019-10-13 21:39:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-13 21:39:34,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-13 21:39:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 21:39:34,497 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 38 states. [2019-10-13 21:39:35,120 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-13 21:39:35,318 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-10-13 21:39:35,494 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-10-13 21:39:35,970 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-13 21:39:36,144 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-10-13 21:39:36,342 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-13 21:39:36,534 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-13 21:39:36,701 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-13 21:39:37,076 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-13 21:39:37,501 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-10-13 21:39:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:37,506 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-10-13 21:39:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-13 21:39:37,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 29 [2019-10-13 21:39:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:37,509 INFO L225 Difference]: With dead ends: 40 [2019-10-13 21:39:37,509 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:39:37,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=374, Invalid=2818, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:39:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:39:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-13 21:39:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 21:39:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 21:39:37,523 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 29 [2019-10-13 21:39:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:37,524 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 21:39:37,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-13 21:39:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 21:39:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:39:37,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:37,525 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:37,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:37,738 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 490960333, now seen corresponding path program 3 times [2019-10-13 21:39:37,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:37,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438639617] [2019-10-13 21:39:37,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:37,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:37,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:38,136 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:38,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438639617] [2019-10-13 21:39:38,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448132687] [2019-10-13 21:39:38,136 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:38,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:39:38,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:39:38,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 21:39:38,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:38,521 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:38,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1209663898] [2019-10-13 21:39:38,726 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:38,726 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:38,727 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:38,727 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:38,727 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:38,750 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-13 21:39:38,964 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,092 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,105 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,117 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,196 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,301 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,485 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,571 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,610 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,645 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,651 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:39,659 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:40,454 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:40,487 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:40,490 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:40,490 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:40,491 INFO L193 IcfgInterpreter]: Reachable states at location L45-2 satisfy 328#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= main_~i~0 2147483647) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:40,491 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:40,491 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 467#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,491 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 476#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:40,492 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 462#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,492 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 457#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,492 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 452#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:40,492 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,492 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (<= 0 |old(~CELLCOUNT~0)|) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:40,493 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 481#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,493 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:40,493 INFO L193 IcfgInterpreter]: Reachable states at location L43-3 satisfy 388#(and (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (or (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)))) [2019-10-13 21:39:40,493 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 114#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (not (= 0 (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) 1 0))) (= 0 |#NULL.base|) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) (= |main_~#volArray~0.offset| 0) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0))) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:40,493 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:40,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 447#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:40,494 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 472#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:40,494 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 443#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:40,958 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-13 21:39:41,757 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:41,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10, 13] total 41 [2019-10-13 21:39:41,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093365034] [2019-10-13 21:39:41,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-13 21:39:41,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:41,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-13 21:39:41,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:39:41,761 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 41 states. [2019-10-13 21:39:42,028 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-10-13 21:39:42,826 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-10-13 21:39:42,957 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-13 21:39:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:39:44,336 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2019-10-13 21:39:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:39:44,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 43 [2019-10-13 21:39:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:39:44,340 INFO L225 Difference]: With dead ends: 67 [2019-10-13 21:39:44,340 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:39:44,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 94 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=565, Invalid=3467, Unknown=0, NotChecked=0, Total=4032 [2019-10-13 21:39:44,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:39:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 21:39:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:39:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-13 21:39:44,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 43 [2019-10-13 21:39:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:39:44,352 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-13 21:39:44,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-13 21:39:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-13 21:39:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:39:44,353 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:39:44,354 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:39:44,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:44,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:39:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:39:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1606685947, now seen corresponding path program 4 times [2019-10-13 21:39:44,558 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:39:44,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871258338] [2019-10-13 21:39:44,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:39:44,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:39:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:44,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871258338] [2019-10-13 21:39:44,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676108415] [2019-10-13 21:39:44,935 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:39:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:39:45,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-13 21:39:45,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:39:45,960 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:45,960 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:39:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:39:46,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143024953] [2019-10-13 21:39:46,330 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-13 21:39:46,330 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:39:46,331 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:39:46,331 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:39:46,331 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:39:46,355 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-13 21:39:46,488 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,634 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,654 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,672 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,851 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:46,986 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,312 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,403 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,465 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,527 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,536 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:47,544 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 21:39:48,341 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-13 21:39:48,375 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-13 21:39:48,378 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:39:48,378 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:39:48,379 INFO L193 IcfgInterpreter]: Reachable states at location L45-2 satisfy 328#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= main_~i~0 2147483647) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:48,379 INFO L193 IcfgInterpreter]: Reachable states at location L11 satisfy 38#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (= 0 (select |old(#valid)| 0)) (<= ~CELLCOUNT~0 2147483647) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:48,379 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 467#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,379 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 476#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:39:48,380 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 462#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,380 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 457#(and (or (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 0) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= |__VERIFIER_assert_#in~cond| 1) (not (= 0 __VERIFIER_assert_~cond)) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,380 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 452#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 1 __VERIFIER_assert_~cond) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:48,380 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= ~CELLCOUNT~0 0) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,380 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (= 0 (select |old(#valid)| 0)) (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (<= ~CELLCOUNT~0 0) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= |old(#length)| |#length|)) [2019-10-13 21:39:48,381 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 481#(and (= ~CELLCOUNT~0 0) (= |#valid| (store |old(#valid)| 0 0)) (<= ~CELLCOUNT~0 0) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 ~CELLCOUNT~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,381 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:39:48,381 INFO L193 IcfgInterpreter]: Reachable states at location L43-3 satisfy 388#(and (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (or (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) (and (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)))) [2019-10-13 21:39:48,381 INFO L193 IcfgInterpreter]: Reachable states at location L22-3 satisfy 114#(and (or (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) (and (not (= 0 (ite (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) 1 0))) (= 0 |#NULL.base|) (= (ite (and (< ~CELLCOUNT~0 0) (not (= (mod ~CELLCOUNT~0 2) 0))) (+ (mod ~CELLCOUNT~0 2) (- 2)) (mod ~CELLCOUNT~0 2)) 0) (= |main_~#volArray~0.offset| 0) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0))) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-13 21:39:48,381 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (= (store |old(#length)| |main_~#volArray~0.base| (* ~CELLCOUNT~0 4)) |#length|) (not (= |main_~#volArray~0.base| 0)) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= 3 main_~CCCELVOL2~0) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:48,382 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 447#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0))) (or (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 21:39:48,382 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 472#(and (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (= |#NULL.offset| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (<= __VERIFIER_assert_~cond 0) (<= |#NULL.base| 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 |#NULL.base|) (<= 0 __VERIFIER_assert_~cond) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:39:48,382 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 443#(and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~0) (<= 0 main_~i~0) (<= |#NULL.base| 0) (<= 0 |main_~#volArray~0.offset|) (<= 1 main_~CCCELVOL1~0) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= |old(~CELLCOUNT~0)| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-13 21:39:49,034 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-13 21:39:50,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:39:50,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14, 13] total 49 [2019-10-13 21:39:50,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961882691] [2019-10-13 21:39:50,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-13 21:39:50,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:39:50,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-13 21:39:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:39:50,057 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 49 states. [2019-10-13 21:39:50,341 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45