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/pr3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:44:18,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:44:18,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:44:18,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:44:18,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:44:18,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:44:18,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:44:18,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:44:18,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:44:18,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:44:18,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:44:18,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:44:18,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:44:18,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:44:18,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:44:18,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:44:18,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:44:18,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:44:18,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:44:18,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:44:18,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:44:18,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:44:18,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:44:18,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:44:18,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:44:18,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:44:18,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:44:18,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:44:18,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:44:18,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:44:18,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:44:18,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:44:18,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:44:18,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:44:18,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:44:18,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:44:18,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:44:18,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:44:18,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:44:18,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:44:18,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:44:18,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 00:44:18,670 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:44:18,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:44:18,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:44:18,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:44:18,672 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:44:18,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:44:18,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:44:18,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:44:18,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:44:18,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:44:18,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:44:18,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:44:18,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:44:18,674 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:44:18,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:44:18,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:44:18,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:44:18,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:44:18,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:44:18,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:44:18,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:44:18,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:44:18,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:44:18,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:44:18,679 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:44:18,679 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:44:18,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:44:18,679 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:44:18,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 00:44:19,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:44:19,050 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:44:19,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:44:19,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:44:19,054 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:44:19,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr3.c [2019-10-07 00:44:19,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d89b06b/1562f5d2eaea4491b8655178e60fc644/FLAGa17520fcc [2019-10-07 00:44:19,562 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:44:19,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr3.c [2019-10-07 00:44:19,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d89b06b/1562f5d2eaea4491b8655178e60fc644/FLAGa17520fcc [2019-10-07 00:44:19,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2d89b06b/1562f5d2eaea4491b8655178e60fc644 [2019-10-07 00:44:19,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:44:19,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:44:19,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:44:19,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:44:19,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:44:19,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:44:19" (1/1) ... [2019-10-07 00:44:19,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da32746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:19, skipping insertion in model container [2019-10-07 00:44:19,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:44:19" (1/1) ... [2019-10-07 00:44:19,976 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:44:20,000 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:44:20,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:44:20,263 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:44:20,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:44:20,324 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:44:20,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20 WrapperNode [2019-10-07 00:44:20,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:44:20,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:44:20,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:44:20,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:44:20,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... [2019-10-07 00:44:20,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:44:20,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:44:20,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:44:20,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:44:20,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:44:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:44:20,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:44:20,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:44:20,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:44:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:44:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 00:44:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:44:20,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:44:20,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:44:20,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:44:21,034 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:44:21,034 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 00:44:21,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:44:21 BoogieIcfgContainer [2019-10-07 00:44:21,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:44:21,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:44:21,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:44:21,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:44:21,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:44:19" (1/3) ... [2019-10-07 00:44:21,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e028f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:44:21, skipping insertion in model container [2019-10-07 00:44:21,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:44:20" (2/3) ... [2019-10-07 00:44:21,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e028f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:44:21, skipping insertion in model container [2019-10-07 00:44:21,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:44:21" (3/3) ... [2019-10-07 00:44:21,045 INFO L109 eAbstractionObserver]: Analyzing ICFG pr3.c [2019-10-07 00:44:21,052 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:44:21,059 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:44:21,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:44:21,094 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:44:21,094 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:44:21,094 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:44:21,095 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:44:21,095 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:44:21,095 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:44:21,095 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:44:21,095 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:44:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-10-07 00:44:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:44:21,117 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:44:21,117 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:44:21,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:44:21,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:44:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1379838131, now seen corresponding path program 1 times [2019-10-07 00:44:21,130 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:44:21,130 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:21,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:21,131 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:44:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:44:21,471 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:21,472 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:44:21,473 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:44:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:44:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:44:21,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:44:21,491 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 4 states. [2019-10-07 00:44:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:44:21,600 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-10-07 00:44:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:44:21,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 00:44:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:44:21,612 INFO L225 Difference]: With dead ends: 42 [2019-10-07 00:44:21,613 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:44:21,619 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:44:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:44:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:44:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:44:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-07 00:44:21,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-07 00:44:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:44:21,661 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-07 00:44:21,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:44:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-07 00:44:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:44:21,664 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:44:21,664 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:44:21,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:44:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:44:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1391156721, now seen corresponding path program 1 times [2019-10-07 00:44:21,665 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:44:21,665 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:21,665 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:21,666 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:21,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:44:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:44:22,124 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:22,125 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:44:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:44:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:22,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-07 00:44:22,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:44:22,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:22,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:22,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:22,417 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:22,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:22,758 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-10-07 00:44:22,759 INFO L567 ElimStorePlain]: treesize reduction 123, result has 51.2 percent of original size [2019-10-07 00:44:22,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 35 [2019-10-07 00:44:22,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:22,916 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-10-07 00:44:22,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 00:44:22,917 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_47| vanished before elimination [2019-10-07 00:44:22,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:22,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2019-10-07 00:44:22,949 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 00:44:23,046 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-10-07 00:44:23,047 INFO L464 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2019-10-07 00:44:23,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2019-10-07 00:44:23,067 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,156 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 00:44:23,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-07 00:44:23,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2019-10-07 00:44:23,183 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-07 00:44:23,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-10-07 00:44:23,265 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:289, output treesize:143 [2019-10-07 00:44:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-07 00:44:23,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:44:23,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:44:23,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,652 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 108 treesize of output 102 [2019-10-07 00:44:23,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,667 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,675 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 82 treesize of output 76 [2019-10-07 00:44:23,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,697 INFO L567 ElimStorePlain]: treesize reduction 24, result has 44.2 percent of original size [2019-10-07 00:44:23,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,912 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 105 [2019-10-07 00:44:23,912 INFO L567 ElimStorePlain]: treesize reduction 10, result has 98.4 percent of original size [2019-10-07 00:44:23,922 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 131 treesize of output 123 [2019-10-07 00:44:23,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-07 00:44:23,947 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 115 treesize of output 107 [2019-10-07 00:44:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 00:44:23,960 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,970 INFO L567 ElimStorePlain]: treesize reduction 41, result has 16.3 percent of original size [2019-10-07 00:44:23,970 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,992 INFO L567 ElimStorePlain]: treesize reduction 482, result has 1.6 percent of original size [2019-10-07 00:44:23,992 INFO L464 ElimStorePlain]: Eliminatee v_prenex_21 vanished before elimination [2019-10-07 00:44:23,992 INFO L464 ElimStorePlain]: Eliminatee v_prenex_13 vanished before elimination [2019-10-07 00:44:23,992 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-10-07 00:44:23,993 INFO L464 ElimStorePlain]: Eliminatee v_prenex_17 vanished before elimination [2019-10-07 00:44:23,993 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-10-07 00:44:23,993 INFO L464 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2019-10-07 00:44:23,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-07 00:44:23,994 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:712, output treesize:8 [2019-10-07 00:44:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:44:24,021 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:44:24,046 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 00:44:24,046 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:44:24,052 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:44:24,068 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:44:24,068 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:44:24,200 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-10-07 00:44:24,563 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:24,589 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:24,614 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:24,986 WARN L191 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 212 [2019-10-07 00:44:25,524 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:25,969 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:25,991 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:26,012 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:26,222 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2019-10-07 00:44:26,343 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:26,582 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2019-10-07 00:44:26,606 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:26,885 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2019-10-07 00:44:26,904 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,184 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-10-07 00:44:27,205 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,223 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,242 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,260 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,280 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,299 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,425 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 00:44:27,535 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 00:44:27,617 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,632 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,648 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,728 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,742 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,770 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,830 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,844 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,857 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:27,993 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,119 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,273 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,379 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,521 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,534 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,546 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:28,687 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 28 for LOIs [2019-10-07 00:44:28,696 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 00:44:28,701 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:44:28,701 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:44:28,702 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-07 00:44:28,702 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 162#(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-07 00:44:28,702 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 171#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:44:28,703 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 167#(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-07 00:44:28,703 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 157#(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-07 00:44:28,703 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-07 00:44:28,703 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-07 00:44:28,704 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 176#(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-07 00:44:28,704 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:44:28,704 INFO L193 IcfgInterpreter]: Reachable states at location L53-3 satisfy 139#(and (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0)) [2019-10-07 00:44:28,704 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 152#(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-07 00:44:28,705 INFO L193 IcfgInterpreter]: Reachable states at location L20 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (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) (= (store |old(#length)| |main_~#volArray~0.base| (* 4 ~CELLCOUNT~0)) |#length|) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= 7 main_~CCCELVOL3~0) (= 7 main_~CCCELVOL3~0) (= 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-07 00:44:28,705 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 134#(and (or (and (= 0 |#NULL.base|) (not (= 0 (ite (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) 1 0))) (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (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) (= (store |old(#length)| |main_~#volArray~0.base| (* 4 ~CELLCOUNT~0)) |#length|) (= main_~i~0 1) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (= 7 main_~CCCELVOL3~0) (= 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)) (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (= |main_~#volArray~0.offset| 0) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |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) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL3~0 7) (<= 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-07 00:44:28,705 INFO L193 IcfgInterpreter]: Reachable states at location L55-2 satisfy 147#(and (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0)) [2019-10-07 00:44:29,228 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-07 00:44:29,613 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:44:29,613 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8, 11] total 29 [2019-10-07 00:44:29,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 00:44:29,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 00:44:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-10-07 00:44:29,624 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 29 states. [2019-10-07 00:44:30,177 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-10-07 00:44:30,504 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-07 00:44:30,718 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-07 00:44:30,928 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-10-07 00:44:31,420 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-10-07 00:44:31,635 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-10-07 00:44:31,940 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-10-07 00:44:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:44:32,100 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-10-07 00:44:32,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 00:44:32,100 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 14 [2019-10-07 00:44:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:44:32,104 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:44:32,104 INFO L226 Difference]: Without dead ends: 32 [2019-10-07 00:44:32,106 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2019-10-07 00:44:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-07 00:44:32,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-07 00:44:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 00:44:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-10-07 00:44:32,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 14 [2019-10-07 00:44:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:44:32,119 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-10-07 00:44:32,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 00:44:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-10-07 00:44:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 00:44:32,121 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:44:32,122 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:44:32,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:44:32,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:44:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:44:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1243584095, now seen corresponding path program 1 times [2019-10-07 00:44:32,327 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:44:32,327 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:32,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:32,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:44:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:32,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:44:32,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:32,667 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:44:32,667 INFO L95 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-07 00:44:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:32,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-07 00:44:32,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:44:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:44:32,919 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:44:33,041 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:44:33,042 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:44:33,043 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-07 00:44:33,043 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:44:33,044 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:44:33,044 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:44:33,044 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:44:33,078 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 25 for LOIs [2019-10-07 00:44:33,270 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,293 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,315 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,524 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 220 [2019-10-07 00:44:33,546 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,566 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,587 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,755 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 210 [2019-10-07 00:44:33,776 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,797 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,817 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:33,926 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2019-10-07 00:44:34,502 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:34,605 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 199 [2019-10-07 00:44:34,797 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,288 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-10-07 00:44:35,320 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,340 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,359 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,493 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-10-07 00:44:35,511 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,849 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:35,952 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-07 00:44:36,114 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,139 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,152 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,218 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,232 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,244 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,329 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,402 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,555 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,726 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,738 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,749 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,796 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,809 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,821 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:36,903 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:37,184 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 19 for LOIs [2019-10-07 00:44:37,231 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2019-10-07 00:44:37,234 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:44:37,235 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:44:37,235 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-07 00:44:37,235 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 249#(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-07 00:44:37,238 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 258#(and (= |old(~CELLCOUNT~0)| ~CELLCOUNT~0) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:44:37,238 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertEXIT satisfy 244#(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-07 00:44:37,238 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 254#(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-07 00:44:37,238 INFO L193 IcfgInterpreter]: Reachable states at location L3-3 satisfy 239#(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-07 00:44:37,238 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 234#(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-07 00:44:37,239 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-07 00:44:37,239 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-07 00:44:37,239 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 263#(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-07 00:44:37,239 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:44:37,239 INFO L193 IcfgInterpreter]: Reachable states at location L53-3 satisfy 224#(or (and (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0) (= main_~i~0 0)) (and (<= |main_~#volArray~0.offset| 0) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~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_~CCCELVOL3~0 7) (<= 7 main_~CCCELVOL3~0) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) [2019-10-07 00:44:37,239 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 229#(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-07 00:44:37,239 INFO L193 IcfgInterpreter]: Reachable states at location L20 satisfy 43#(and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (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) (= (store |old(#length)| |main_~#volArray~0.base| (* 4 ~CELLCOUNT~0)) |#length|) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= 7 main_~CCCELVOL3~0) (= 7 main_~CCCELVOL3~0) (<= |#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-07 00:44:37,240 INFO L193 IcfgInterpreter]: Reachable states at location L55-3 satisfy 215#(and (<= |main_~#volArray~0.offset| 0) (<= 0 main_~i~0) (<= 0 |main_~#volArray~0.offset|) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3) (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= 1 ~CELLCOUNT~0) |main_#t~short6| (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (<= |old(~CELLCOUNT~0)| 0) (<= 7 main_~CCCELVOL3~0) (<= |#NULL.offset| 0) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-07 00:44:37,240 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 134#(and (or (and (<= |main_~#volArray~0.offset| 0) (= 0 |#NULL.base|) (not (= 0 (ite (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) 1 0))) (<= 0 |main_~#volArray~0.offset|) (= 0 (ite (and (not (= (mod ~CELLCOUNT~0 3) 0)) (< ~CELLCOUNT~0 0)) (+ (mod ~CELLCOUNT~0 3) (- 3)) (mod ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (<= 0 |#NULL.base|) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= 0 |old(~CELLCOUNT~0)|) (not (= |main_~#volArray~0.base| 0)) (<= 1 main_~i~0) (= |#valid| (store |old(#valid)| |main_~#volArray~0.base| 1)) (= 1 main_~CCCELVOL1~0) (<= main_~i~0 1) (= 3 main_~CCCELVOL2~0) (= (store |old(#length)| |main_~#volArray~0.base| (* 4 ~CELLCOUNT~0)) |#length|) (<= 1 ~CELLCOUNT~0) (<= |#NULL.base| 0) (<= 1 main_~CCCELVOL1~0) (= main_~i~0 1) (<= |old(~CELLCOUNT~0)| 0) (< |main_~#volArray~0.base| |#StackHeapBarrier|) (<= 7 main_~CCCELVOL3~0) (= 7 main_~CCCELVOL3~0) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0)) (< 1 ~CELLCOUNT~0) (<= ~CELLCOUNT~0 2147483647) (= 0 (select |old(#valid)| |main_~#volArray~0.base|)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= 0 (+ ~CELLCOUNT~0 2147483648)) (= |old(~CELLCOUNT~0)| 0)) (and (= |#NULL.base| 0) (= main_~CCCELVOL1~0 1) (<= |main_~#volArray~0.offset| 0) (<= 1 ~CELLCOUNT~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) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= 1 main_~i~0) (= main_~CCCELVOL3~0 7) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0))) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (<= main_~CCCELVOL2~0 3)) [2019-10-07 00:44:37,240 INFO L193 IcfgInterpreter]: Reachable states at location L55-2 satisfy 203#(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) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL3~0 7) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |old(~CELLCOUNT~0)|) (<= ~CELLCOUNT~0 2147483647) (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= main_~CCCELVOL3~0 7) (<= main_~CCCELVOL2~0 3) (= main_~CCCELVOL2~0 3) (= |#NULL.offset| 0) (= |old(~CELLCOUNT~0)| 0)) [2019-10-07 00:44:37,691 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2019-10-07 00:44:38,038 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2019-10-07 00:44:38,570 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:44:38,571 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8, 13] total 35 [2019-10-07 00:44:38,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-07 00:44:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-07 00:44:38,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 00:44:38,573 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 35 states. [2019-10-07 00:44:38,825 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-10-07 00:44:39,283 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-10-07 00:44:39,635 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-07 00:44:39,763 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-10-07 00:44:41,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:44:41,024 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-07 00:44:41,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-07 00:44:41,025 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-10-07 00:44:41,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:44:41,029 INFO L225 Difference]: With dead ends: 54 [2019-10-07 00:44:41,029 INFO L226 Difference]: Without dead ends: 31 [2019-10-07 00:44:41,031 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 74 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=454, Invalid=2852, Unknown=0, NotChecked=0, Total=3306 [2019-10-07 00:44:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-07 00:44:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-07 00:44:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 00:44:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-10-07 00:44:41,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 35 [2019-10-07 00:44:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:44:41,041 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-10-07 00:44:41,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-07 00:44:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2019-10-07 00:44:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 00:44:41,042 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:44:41,042 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:44:41,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:44:41,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:44:41,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:44:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1261021469, now seen corresponding path program 2 times [2019-10-07 00:44:41,247 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:44:41,247 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:41,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:41,247 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:44:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:44:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:44:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:44:41,665 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:44:41,665 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:44:41,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:44:41,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-07 00:44:41,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:44:41,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-07 00:44:41,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:44:41,848 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-07 00:44:42,074 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-10-07 00:44:46,721 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-10-07 00:44:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-07 00:44:47,556 INFO L322 TraceCheckSpWp]: Computing backward predicates...