java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_01.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:24:33,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:24:33,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:24:33,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:24:33,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:24:33,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:24:33,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:24:33,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:24:33,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:24:33,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:24:33,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:24:33,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:24:33,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:24:33,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:24:33,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:24:33,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:24:33,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:24:33,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:24:33,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:24:33,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:24:33,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:24:33,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:24:33,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:24:33,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:24:33,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:24:33,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:24:33,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:24:33,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:24:33,320 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:24:33,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:24:33,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:24:33,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:24:33,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:24:33,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:24:33,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:24:33,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:24:33,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:24:33,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:24:33,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:24:33,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:24:33,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:24:33,337 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:24:33,360 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:24:33,360 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:24:33,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:24:33,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:24:33,362 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:24:33,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:24:33,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:24:33,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:24:33,363 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:24:33,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:24:33,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:24:33,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:24:33,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:24:33,364 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:24:33,365 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:24:33,365 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:24:33,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:24:33,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:24:33,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:24:33,366 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:24:33,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:24:33,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:33,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:24:33,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:24:33,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:24:33,367 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:24:33,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:24:33,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:24:33,368 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:24:33,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:24:33,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:24:33,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:24:33,702 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:24:33,702 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:24:33,703 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_01.i [2019-10-07 00:24:33,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f94c266/d98c5b6e1a0a43e2aeeed2c5d9dbf09f/FLAG4c6f79aa9 [2019-10-07 00:24:34,286 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:24:34,287 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_01.i [2019-10-07 00:24:34,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f94c266/d98c5b6e1a0a43e2aeeed2c5d9dbf09f/FLAG4c6f79aa9 [2019-10-07 00:24:34,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f94c266/d98c5b6e1a0a43e2aeeed2c5d9dbf09f [2019-10-07 00:24:34,673 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:24:34,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:24:34,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:34,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:24:34,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:24:34,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:34,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e616d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34, skipping insertion in model container [2019-10-07 00:24:34,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:34,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:24:34,712 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:24:34,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:34,919 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:24:34,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:34,961 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:24:34,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34 WrapperNode [2019-10-07 00:24:34,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:34,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:24:34,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:24:34,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:24:35,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,080 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (1/1) ... [2019-10-07 00:24:35,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:24:35,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:24:35,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:24:35,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:24:35,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (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:24:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:24:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:24:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:24:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:24:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:24:35,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:24:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:24:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:24:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:24:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:24:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:24:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:24:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:24:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:24:35,466 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:24:35,466 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:24:35,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:35 BoogieIcfgContainer [2019-10-07 00:24:35,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:24:35,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:24:35,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:24:35,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:24:35,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:24:34" (1/3) ... [2019-10-07 00:24:35,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b39ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:35, skipping insertion in model container [2019-10-07 00:24:35,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:34" (2/3) ... [2019-10-07 00:24:35,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b39ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:35, skipping insertion in model container [2019-10-07 00:24:35,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:35" (3/3) ... [2019-10-07 00:24:35,477 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_01.i [2019-10-07 00:24:35,490 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:24:35,518 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:24:35,537 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:24:35,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:24:35,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:24:35,560 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:24:35,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:24:35,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:24:35,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:24:35,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:24:35,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:24:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-07 00:24:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 00:24:35,582 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:35,583 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:35,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:35,590 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-07 00:24:35,596 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:35,597 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:35,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:35,597 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:35,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:35,766 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:24:35,767 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:35,768 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:35,768 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:35,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:35,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:35,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:35,787 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-07 00:24:35,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:35,855 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-07 00:24:35,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:35,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 00:24:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:35,867 INFO L225 Difference]: With dead ends: 37 [2019-10-07 00:24:35,868 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:24:35,871 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:24:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-07 00:24:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:24:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:24:35,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-10-07 00:24:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:35,910 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:24:35,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:24:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:24:35,911 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:35,911 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:35,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:35,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-07 00:24:35,913 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:35,913 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:35,913 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:35,914 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:35,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:35,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:35,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:35,999 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:24:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:36,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:36,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:36,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:36,098 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:36,135 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:36,163 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:36,163 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:36,170 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:36,179 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:36,180 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:36,410 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:36,889 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-10-07 00:24:37,048 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:24:37,070 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:37,080 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:37,080 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:37,081 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:37,081 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:37,082 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:37,082 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:37,083 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:24:37,083 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:37,083 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:37,083 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:37,084 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:37,084 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:37,085 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:37,085 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:37,086 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))))) [2019-10-07 00:24:37,377 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:37,377 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 16 [2019-10-07 00:24:37,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-07 00:24:37,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-07 00:24:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-10-07 00:24:37,381 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2019-10-07 00:24:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:38,085 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-10-07 00:24:38,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:24:38,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-10-07 00:24:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:38,088 INFO L225 Difference]: With dead ends: 44 [2019-10-07 00:24:38,088 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 00:24:38,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2019-10-07 00:24:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 00:24:38,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-10-07 00:24:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 00:24:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-07 00:24:38,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-07 00:24:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:38,097 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-07 00:24:38,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-07 00:24:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-07 00:24:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 00:24:38,098 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:38,098 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:38,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:38,304 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:38,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1399192635, now seen corresponding path program 2 times [2019-10-07 00:24:38,306 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:38,306 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:38,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:38,306 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:38,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:38,387 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:38,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:38,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:24:38,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:38,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:38,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:24:38,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:24:38,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:38,486 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:38,487 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:38,487 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:38,487 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:38,488 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:38,538 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:38,931 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:24:38,954 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:38,962 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:38,962 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:38,962 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:38,967 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:38,967 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:38,967 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:38,968 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:24:38,969 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:38,969 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:38,969 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:38,970 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:38,970 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:38,970 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:38,971 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:38,971 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) [2019-10-07 00:24:39,258 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:39,259 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 20 [2019-10-07 00:24:39,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 00:24:39,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 00:24:39,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-10-07 00:24:39,261 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 20 states. [2019-10-07 00:24:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:40,046 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-10-07 00:24:40,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 00:24:40,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-10-07 00:24:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:40,048 INFO L225 Difference]: With dead ends: 66 [2019-10-07 00:24:40,048 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 00:24:40,049 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2019-10-07 00:24:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 00:24:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-10-07 00:24:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-07 00:24:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-07 00:24:40,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2019-10-07 00:24:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:40,060 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-07 00:24:40,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 00:24:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-07 00:24:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 00:24:40,062 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:40,062 INFO L385 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:40,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:40,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1958482009, now seen corresponding path program 3 times [2019-10-07 00:24:40,266 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:40,267 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,267 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 00:24:40,464 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:40,464 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:40,465 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:40,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:24:40,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:40,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-07 00:24:40,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:40,557 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 00:24:40,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-07 00:24:40,683 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:40,685 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:40,685 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:40,686 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:40,686 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:40,686 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:40,729 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:41,023 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:24:41,035 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:41,040 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:41,041 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:41,041 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,041 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:41,042 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,042 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:41,042 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:24:41,042 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:41,043 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:41,043 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,043 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,043 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:41,044 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:41,044 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:41,044 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) [2019-10-07 00:24:41,322 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:41,322 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 11] total 29 [2019-10-07 00:24:41,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-07 00:24:41,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-07 00:24:41,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2019-10-07 00:24:41,325 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 29 states. [2019-10-07 00:24:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:42,843 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2019-10-07 00:24:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-07 00:24:42,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 26 [2019-10-07 00:24:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:42,850 INFO L225 Difference]: With dead ends: 117 [2019-10-07 00:24:42,850 INFO L226 Difference]: Without dead ends: 100 [2019-10-07 00:24:42,852 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=692, Invalid=1960, Unknown=0, NotChecked=0, Total=2652 [2019-10-07 00:24:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-07 00:24:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 48. [2019-10-07 00:24:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-07 00:24:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2019-10-07 00:24:42,867 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 26 [2019-10-07 00:24:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:42,868 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2019-10-07 00:24:42,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-07 00:24:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2019-10-07 00:24:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 00:24:42,869 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:42,869 INFO L385 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:43,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:43,073 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:43,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -296018724, now seen corresponding path program 4 times [2019-10-07 00:24:43,074 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:43,074 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:43,074 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:43,075 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:43,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-07 00:24:43,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:43,412 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:43,412 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:43,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-07 00:24:43,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:43,530 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-07 00:24:43,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-10-07 00:24:43,911 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:43,912 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:24:43,912 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:43,913 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:43,913 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:43,913 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:43,955 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:44,260 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:24:44,269 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:44,273 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:44,273 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:44,274 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:44,274 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:44,274 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:44,274 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:44,275 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:24:44,275 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:24:44,275 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:44,276 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:44,278 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:44,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:24:44,280 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:44,280 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:44,280 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-07 00:24:44,581 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:44,581 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 11] total 47 [2019-10-07 00:24:44,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-07 00:24:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-07 00:24:44,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=1396, Unknown=0, NotChecked=0, Total=2162 [2019-10-07 00:24:44,585 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 47 states. [2019-10-07 00:24:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:47,886 INFO L93 Difference]: Finished difference Result 216 states and 287 transitions. [2019-10-07 00:24:47,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-07 00:24:47,887 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 44 [2019-10-07 00:24:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:47,889 INFO L225 Difference]: With dead ends: 216 [2019-10-07 00:24:47,889 INFO L226 Difference]: Without dead ends: 190 [2019-10-07 00:24:47,895 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2285, Invalid=5371, Unknown=0, NotChecked=0, Total=7656 [2019-10-07 00:24:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-07 00:24:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 84. [2019-10-07 00:24:47,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-07 00:24:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-10-07 00:24:47,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 44 [2019-10-07 00:24:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:47,951 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-10-07 00:24:47,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-07 00:24:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-10-07 00:24:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-07 00:24:47,955 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:47,955 INFO L385 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:48,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:48,156 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 348450940, now seen corresponding path program 5 times [2019-10-07 00:24:48,157 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:48,157 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:48,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:48,158 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:24:49,034 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:49,034 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:49,035 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:36,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-07 00:28:36,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:36,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-07 00:28:36,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:28:36,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-10-07 00:28:38,414 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:38,416 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:38,416 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:38,416 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:38,417 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:38,417 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:38,449 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:38,671 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-10-07 00:28:38,712 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:28:38,719 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:38,722 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:38,722 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:38,722 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:38,722 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:28:38,723 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:38,723 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:38,723 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:28:38,723 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:28:38,724 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:38,724 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:38,724 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-07 00:28:38,724 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:38,725 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:38,725 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:38,725 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) [2019-10-07 00:28:39,110 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:39,110 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37, 11] total 83 [2019-10-07 00:28:39,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-10-07 00:28:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-10-07 00:28:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2800, Invalid=4006, Unknown=0, NotChecked=0, Total=6806 [2019-10-07 00:28:39,115 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 83 states. [2019-10-07 00:28:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:28:46,813 INFO L93 Difference]: Finished difference Result 414 states and 557 transitions. [2019-10-07 00:28:46,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-07 00:28:46,814 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 80 [2019-10-07 00:28:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:28:46,817 INFO L225 Difference]: With dead ends: 414 [2019-10-07 00:28:46,817 INFO L226 Difference]: Without dead ends: 370 [2019-10-07 00:28:46,829 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5294 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=8387, Invalid=17053, Unknown=0, NotChecked=0, Total=25440 [2019-10-07 00:28:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-07 00:28:46,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 156. [2019-10-07 00:28:46,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-10-07 00:28:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2019-10-07 00:28:46,897 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 80 [2019-10-07 00:28:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:28:46,900 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2019-10-07 00:28:46,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-10-07 00:28:46,900 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2019-10-07 00:28:46,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-07 00:28:46,908 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:28:46,908 INFO L385 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:28:47,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:47,112 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:28:47,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:28:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 135487420, now seen corresponding path program 6 times [2019-10-07 00:28:47,113 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:28:47,113 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:47,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:47,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:28:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:28:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:28:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-10-07 00:28:49,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:28:49,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:28:49,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:28:49,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 00:28:49,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:28:49,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 72 conjunts are in the unsatisfiable core [2019-10-07 00:28:49,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:28:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-10-07 00:28:49,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:28:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-10-07 00:28:55,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:28:55,053 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:28:55,054 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:28:55,054 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:28:55,054 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:28:55,054 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:28:55,073 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:28:55,324 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:28:55,331 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:28:55,334 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:28:55,334 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:28:55,334 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:28:55,334 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:28:55,335 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 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:28:55,335 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:28:55,335 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:28:55,335 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:28:55,335 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 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:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:28:55,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) [2019-10-07 00:28:55,845 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:28:55,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73, 11] total 155 [2019-10-07 00:28:55,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-10-07 00:28:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-10-07 00:28:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10756, Invalid=13114, Unknown=0, NotChecked=0, Total=23870 [2019-10-07 00:28:55,855 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 155 states. [2019-10-07 00:29:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:29:25,527 INFO L93 Difference]: Finished difference Result 810 states and 1097 transitions. [2019-10-07 00:29:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-10-07 00:29:25,528 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 152 [2019-10-07 00:29:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:29:25,534 INFO L225 Difference]: With dead ends: 810 [2019-10-07 00:29:25,534 INFO L226 Difference]: Without dead ends: 730 [2019-10-07 00:29:25,541 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17084 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=32255, Invalid=59857, Unknown=0, NotChecked=0, Total=92112 [2019-10-07 00:29:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-07 00:29:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 300. [2019-10-07 00:29:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-07 00:29:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2019-10-07 00:29:25,637 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 152 [2019-10-07 00:29:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:29:25,637 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2019-10-07 00:29:25,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-10-07 00:29:25,638 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2019-10-07 00:29:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-07 00:29:25,642 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:29:25,642 INFO L385 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:29:25,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:25,854 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:29:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:29:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash -910991812, now seen corresponding path program 7 times [2019-10-07 00:29:25,855 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:29:25,855 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:25,856 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:25,856 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:29:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:29:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-07 00:29:34,156 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:29:34,156 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:29:34,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:29:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:29:34,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 144 conjunts are in the unsatisfiable core [2019-10-07 00:29:34,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:29:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-07 00:29:34,644 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:29:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 10153 trivial. 0 not checked. [2019-10-07 00:29:57,323 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:29:57,324 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-07 00:29:57,324 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:29:57,325 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:29:57,325 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:29:57,325 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:29:57,343 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:29:57,566 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:29:57,571 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:29:57,574 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:29:57,574 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:29:57,574 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:57,574 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 116#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (= main_~j~0 0) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:29:57,574 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:57,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:29:57,575 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 0 main_~i~0) [2019-10-07 00:29:57,575 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~j~0) |main_~#a~0.offset|))) (<= 0 main_~i~0) (= main_~j~0 0) (< main_~i~0 10000) (= (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~j~0) |main_~#b~0.offset|)) |main_#t~mem3|) (<= main_~i~0 0) (<= main_~j~0 0) (= main_~i~0 0)) [2019-10-07 00:29:57,575 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:29:57,575 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:57,576 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:57,576 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-07 00:29:57,576 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:29:57,576 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:29:57,576 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) [2019-10-07 00:29:58,386 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:29:58,386 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145, 145, 11] total 299 [2019-10-07 00:29:58,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 299 states [2019-10-07 00:29:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 299 interpolants. [2019-10-07 00:29:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42220, Invalid=46882, Unknown=0, NotChecked=0, Total=89102 [2019-10-07 00:29:58,400 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 299 states. [2019-10-07 00:32:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:32:04,153 INFO L93 Difference]: Finished difference Result 1602 states and 2177 transitions. [2019-10-07 00:32:04,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2019-10-07 00:32:04,153 INFO L78 Accepts]: Start accepts. Automaton has 299 states. Word has length 296 [2019-10-07 00:32:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:32:04,163 INFO L225 Difference]: With dead ends: 1602 [2019-10-07 00:32:04,163 INFO L226 Difference]: Without dead ends: 1450 [2019-10-07 00:32:04,179 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1613 GetRequests, 1023 SyntacticMatches, 0 SemanticMatches, 590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60104 ImplicationChecksByTransitivity, 79.7s TimeCoverageRelationStatistics Valid=126647, Invalid=223225, Unknown=0, NotChecked=0, Total=349872 [2019-10-07 00:32:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-07 00:32:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 588. [2019-10-07 00:32:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-07 00:32:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 590 transitions. [2019-10-07 00:32:04,279 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 590 transitions. Word has length 296 [2019-10-07 00:32:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:32:04,280 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 590 transitions. [2019-10-07 00:32:04,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 299 states. [2019-10-07 00:32:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 590 transitions. [2019-10-07 00:32:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-10-07 00:32:04,292 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:32:04,293 INFO L385 BasicCegarLoop]: trace histogram [286, 286, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:32:04,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:32:04,505 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:32:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:32:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1841290044, now seen corresponding path program 8 times [2019-10-07 00:32:04,505 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:32:04,505 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:32:04,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:32:04,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:32:04,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:32:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:32:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 82082 backedges. 0 proven. 41041 refuted. 0 times theorem prover too weak. 41041 trivial. 0 not checked. [2019-10-07 00:32:36,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:32:36,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:32:37,000 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true