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_copy1_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:03,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:03,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:03,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:03,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:03,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:03,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:03,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:03,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:03,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:03,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:03,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:03,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:03,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:03,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:03,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:03,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:03,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:03,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:03,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:03,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:03,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:03,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:03,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:03,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:03,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:03,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:03,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:03,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:03,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:03,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:03,254 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:03,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:03,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:03,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:03,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:03,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:03,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:03,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:03,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:03,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:03,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:03,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:03,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:03,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:03,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:03,300 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:03,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:03,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:03,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:03,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:03,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:03,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:03,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:03,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:03,302 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:03,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:03,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:03,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:03,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:03,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:03,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:03,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:03,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:03,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:03,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:03,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:03,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:03,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:03,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:03,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:03,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:03,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:03,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:03,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:03,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:03,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy1_ground-1.i [2019-10-13 21:33:03,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ff0dc75/de3a35cfeff142679448e880d73d90ce/FLAG1bc2eaf07 [2019-10-13 21:33:04,194 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:04,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy1_ground-1.i [2019-10-13 21:33:04,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ff0dc75/de3a35cfeff142679448e880d73d90ce/FLAG1bc2eaf07 [2019-10-13 21:33:04,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ff0dc75/de3a35cfeff142679448e880d73d90ce [2019-10-13 21:33:04,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:04,619 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:04,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:04,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:04,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:04,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:04,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2e6592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04, skipping insertion in model container [2019-10-13 21:33:04,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:04,636 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:04,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:04,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:04,884 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:04,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:04,934 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:04,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04 WrapperNode [2019-10-13 21:33:04,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:04,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:04,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:04,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:05,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... [2019-10-13 21:33:05,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:05,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:05,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:05,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:05,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:05,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:05,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:05,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:05,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:05,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:05,485 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:05,485 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:33:05,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:05 BoogieIcfgContainer [2019-10-13 21:33:05,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:05,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:05,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:05,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:05,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:04" (1/3) ... [2019-10-13 21:33:05,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0c388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:05, skipping insertion in model container [2019-10-13 21:33:05,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:04" (2/3) ... [2019-10-13 21:33:05,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0c388a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:05, skipping insertion in model container [2019-10-13 21:33:05,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:05" (3/3) ... [2019-10-13 21:33:05,494 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy1_ground-1.i [2019-10-13 21:33:05,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:05,510 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:05,521 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:05,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:05,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:05,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:05,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:05,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:05,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:05,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:05,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:33:05,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:33:05,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:05,571 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:05,572 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:05,577 INFO L82 PathProgramCache]: Analyzing trace with hash -973561822, now seen corresponding path program 1 times [2019-10-13 21:33:05,584 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:05,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978118187] [2019-10-13 21:33:05,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:05,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978118187] [2019-10-13 21:33:05,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:05,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:05,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288250281] [2019-10-13 21:33:05,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:05,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:05,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:05,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:05,760 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:33:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:05,795 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:33:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:05,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:33:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:05,806 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:33:05,806 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:33:05,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:33:05,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:33:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:33:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:33:05,844 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:33:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:05,845 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:33:05,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:05,845 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:33:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:33:05,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:05,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:05,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1904463274, now seen corresponding path program 1 times [2019-10-13 21:33:05,848 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:05,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481501679] [2019-10-13 21:33:05,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:05,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481501679] [2019-10-13 21:33:05,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:05,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:05,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004783585] [2019-10-13 21:33:05,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:05,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:05,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:05,925 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:33:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:05,942 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-13 21:33:05,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:05,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:33:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:05,944 INFO L225 Difference]: With dead ends: 27 [2019-10-13 21:33:05,944 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:33:05,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:33:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:33:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:33:05,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:33:05,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:33:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:05,952 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:33:05,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:33:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:05,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:05,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:05,954 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:05,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:05,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1479457838, now seen corresponding path program 1 times [2019-10-13 21:33:05,955 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:05,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570047625] [2019-10-13 21:33:05,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,955 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:05,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:06,039 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-13 21:33:06,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570047625] [2019-10-13 21:33:06,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040315660] [2019-10-13 21:33:06,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:06,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:06,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:06,157 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-13 21:33:06,158 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:06,198 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-13 21:33:06,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2016419674] [2019-10-13 21:33:06,223 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:06,223 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:06,230 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:06,245 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:06,247 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:06,418 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:06,885 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:07,031 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:07,054 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:07,063 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:07,063 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:07,063 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:07,064 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:07,064 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-13 21:33:07,064 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:07,065 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:07,065 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:07,065 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-13 21:33:07,066 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-13 21:33:07,066 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-13 21:33:07,066 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:07,067 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:07,067 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a2~0.base_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_3) v_prenex_4))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_1|) |v_main_~#a2~0.offset_BEFORE_CALL_1|)))))) [2019-10-13 21:33:07,068 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:07,435 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:07,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:07,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432856314] [2019-10-13 21:33:07,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:07,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:07,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:07,441 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:33:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:08,143 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-10-13 21:33:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:08,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:33:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:08,146 INFO L225 Difference]: With dead ends: 42 [2019-10-13 21:33:08,146 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 21:33:08,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 21:33:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-13 21:33:08,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:33:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-13 21:33:08,162 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2019-10-13 21:33:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:08,162 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-13 21:33:08,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-13 21:33:08,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:33:08,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:08,165 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:08,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:08,377 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash 689715618, now seen corresponding path program 2 times [2019-10-13 21:33:08,378 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:08,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462280953] [2019-10-13 21:33:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:08,379 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:33:08,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462280953] [2019-10-13 21:33:08,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537266892] [2019-10-13 21:33:08,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:08,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:08,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:08,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:08,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:33:08,632 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:33:08,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1307339812] [2019-10-13 21:33:08,676 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:08,676 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:08,677 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:08,677 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:08,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:08,713 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:09,086 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:09,097 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:09,103 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:09,103 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:09,103 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:09,104 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:09,104 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-13 21:33:09,104 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:09,105 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:09,105 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:09,105 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-13 21:33:09,105 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-13 21:33:09,106 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-13 21:33:09,106 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:09,106 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:09,107 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a2~0.base_BEFORE_CALL_2| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_2|) |v_main_~#a2~0.offset_BEFORE_CALL_2|)))))) [2019-10-13 21:33:09,107 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:09,413 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:09,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-13 21:33:09,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703402339] [2019-10-13 21:33:09,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:33:09,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:33:09,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:33:09,416 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 23 states. [2019-10-13 21:33:10,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:10,197 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-10-13 21:33:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:33:10,199 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-10-13 21:33:10,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:10,200 INFO L225 Difference]: With dead ends: 48 [2019-10-13 21:33:10,200 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 21:33:10,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-13 21:33:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 21:33:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-10-13 21:33:10,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 21:33:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-13 21:33:10,215 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-13 21:33:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:10,215 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-13 21:33:10,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:33:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-13 21:33:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 21:33:10,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:10,221 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:10,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:10,424 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1653576662, now seen corresponding path program 3 times [2019-10-13 21:33:10,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:10,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684198460] [2019-10-13 21:33:10,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:10,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:33:10,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684198460] [2019-10-13 21:33:10,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206332443] [2019-10-13 21:33:10,554 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:10,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:10,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:10,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:33:10,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:10,686 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 21:33:10,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [604108995] [2019-10-13 21:33:10,775 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:10,775 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:10,776 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:10,776 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:10,776 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:10,804 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:11,081 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-13 21:33:11,156 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:11,172 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:11,183 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:11,183 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:11,183 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:11,184 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:11,184 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-13 21:33:11,184 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:11,185 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:11,185 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:11,185 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-13 21:33:11,185 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-13 21:33:11,186 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-13 21:33:11,187 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:11,191 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:11,191 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a2~0.base_BEFORE_CALL_3| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_3|) |v_main_~#a2~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12))))) [2019-10-13 21:33:11,192 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:11,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:11,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-13 21:33:11,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270410902] [2019-10-13 21:33:11,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:11,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:11,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:11,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:11,542 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 31 states. [2019-10-13 21:33:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:12,775 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2019-10-13 21:33:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 21:33:12,775 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 23 [2019-10-13 21:33:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:12,776 INFO L225 Difference]: With dead ends: 60 [2019-10-13 21:33:12,776 INFO L226 Difference]: Without dead ends: 44 [2019-10-13 21:33:12,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-13 21:33:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-13 21:33:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2019-10-13 21:33:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 21:33:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-13 21:33:12,791 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2019-10-13 21:33:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:12,791 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-13 21:33:12,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-13 21:33:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:33:12,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:12,794 INFO L380 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:12,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:12,999 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:13,000 INFO L82 PathProgramCache]: Analyzing trace with hash 584037126, now seen corresponding path program 4 times [2019-10-13 21:33:13,000 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:13,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051381861] [2019-10-13 21:33:13,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:13,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:13,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:33:13,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051381861] [2019-10-13 21:33:13,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845669238] [2019-10-13 21:33:13,120 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:13,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:33:13,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:13,374 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:33:13,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2022791421] [2019-10-13 21:33:13,689 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:13,689 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:13,690 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:13,690 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:13,690 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:13,721 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:14,005 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:14,014 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:14,017 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:14,018 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:14,018 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:14,018 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~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-13 21:33:14,019 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-13 21:33:14,019 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:14,019 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~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-13 21:33:14,019 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:14,020 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-13 21:33:14,021 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-13 21:33:14,021 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-13 21:33:14,021 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:14,021 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:14,021 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (|v_main_~#a2~0.base_BEFORE_CALL_4| Int) (v_prenex_13 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_4|) |v_main_~#a2~0.offset_BEFORE_CALL_4|))))) [2019-10-13 21:33:14,022 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:14,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:14,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15, 11] total 46 [2019-10-13 21:33:14,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231477307] [2019-10-13 21:33:14,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-13 21:33:14,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-13 21:33:14,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=1619, Unknown=0, NotChecked=0, Total=2070 [2019-10-13 21:33:14,414 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 46 states. [2019-10-13 21:33:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:16,337 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2019-10-13 21:33:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-13 21:33:16,337 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 31 [2019-10-13 21:33:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:16,338 INFO L225 Difference]: With dead ends: 76 [2019-10-13 21:33:16,339 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 21:33:16,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1363, Invalid=6119, Unknown=0, NotChecked=0, Total=7482 [2019-10-13 21:33:16,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 21:33:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2019-10-13 21:33:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-13 21:33:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-13 21:33:16,352 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 31 [2019-10-13 21:33:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:16,353 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-13 21:33:16,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-13 21:33:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-13 21:33:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 21:33:16,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:16,354 INFO L380 BasicCegarLoop]: trace histogram [26, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:16,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:16,559 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:16,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:16,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1963452066, now seen corresponding path program 5 times [2019-10-13 21:33:16,560 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:16,560 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201249530] [2019-10-13 21:33:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:16,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:33:16,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201249530] [2019-10-13 21:33:16,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413664038] [2019-10-13 21:33:16,725 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:16,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:16,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:16,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:33:16,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:33:16,876 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:33:17,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068226] [2019-10-13 21:33:17,007 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:17,008 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:17,008 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:17,008 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:17,008 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:17,029 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:17,281 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:17,287 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:17,290 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:17,291 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:17,291 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,291 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,291 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-13 21:33:17,292 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:17,292 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:17,292 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:17,292 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-13 21:33:17,292 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-13 21:33:17,293 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-13 21:33:17,293 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:17,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:17,293 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a2~0.base_BEFORE_CALL_5| Int) (v_prenex_20 Int) (|v_main_~#a2~0.offset_BEFORE_CALL_5| Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_5|) |v_main_~#a2~0.offset_BEFORE_CALL_5|)))))) [2019-10-13 21:33:17,293 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:17,592 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:17,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 31 [2019-10-13 21:33:17,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194509034] [2019-10-13 21:33:17,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-13 21:33:17,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-13 21:33:17,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:17,596 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 31 states. [2019-10-13 21:33:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:18,768 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-10-13 21:33:18,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 21:33:18,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 46 [2019-10-13 21:33:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:18,770 INFO L225 Difference]: With dead ends: 78 [2019-10-13 21:33:18,770 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:33:18,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=708, Invalid=2372, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:33:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:33:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-13 21:33:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-13 21:33:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-10-13 21:33:18,794 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 46 [2019-10-13 21:33:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:18,794 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-10-13 21:33:18,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-13 21:33:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-10-13 21:33:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:33:18,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:18,800 INFO L380 BasicCegarLoop]: trace histogram [26, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:19,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:19,005 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:19,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -575920862, now seen corresponding path program 6 times [2019-10-13 21:33:19,006 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:19,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020502109] [2019-10-13 21:33:19,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:19,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:19,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:33:19,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020502109] [2019-10-13 21:33:19,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910244930] [2019-10-13 21:33:19,345 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:33:19,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:19,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:19,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 21:33:19,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-13 21:33:20,217 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-13 21:33:21,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2038569378] [2019-10-13 21:33:21,644 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:21,644 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:21,645 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:21,645 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:21,645 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:21,672 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:21,914 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:21,921 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:21,925 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:21,925 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:21,925 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:21,925 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:21,926 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-13 21:33:21,926 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:21,926 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:21,926 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:21,926 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-13 21:33:21,927 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-13 21:33:21,927 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-13 21:33:21,927 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:21,927 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:21,927 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a2~0.base_BEFORE_CALL_6| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_6|) |v_main_~#a2~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))))) [2019-10-13 21:33:21,928 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:22,416 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:22,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29, 29, 11] total 85 [2019-10-13 21:33:22,416 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538900492] [2019-10-13 21:33:22,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-13 21:33:22,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-13 21:33:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=5362, Unknown=0, NotChecked=0, Total=7140 [2019-10-13 21:33:22,421 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 85 states. [2019-10-13 21:33:27,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:27,238 INFO L93 Difference]: Finished difference Result 126 states and 158 transitions. [2019-10-13 21:33:27,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-13 21:33:27,239 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 56 [2019-10-13 21:33:27,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:27,240 INFO L225 Difference]: With dead ends: 126 [2019-10-13 21:33:27,241 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 21:33:27,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6399 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5366, Invalid=21694, Unknown=0, NotChecked=0, Total=27060 [2019-10-13 21:33:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 21:33:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2019-10-13 21:33:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-13 21:33:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2019-10-13 21:33:27,262 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 56 [2019-10-13 21:33:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:27,262 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2019-10-13 21:33:27,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-13 21:33:27,262 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2019-10-13 21:33:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 21:33:27,264 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,264 INFO L380 BasicCegarLoop]: trace histogram [54, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:27,466 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2105438330, now seen corresponding path program 7 times [2019-10-13 21:33:27,467 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412985289] [2019-10-13 21:33:27,467 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-10-13 21:33:27,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412985289] [2019-10-13 21:33:27,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472370379] [2019-10-13 21:33:27,854 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 21:33:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 56 conjunts are in the unsatisfiable core [2019-10-13 21:33:28,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-13 21:33:29,662 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1675 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-10-13 21:33:34,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [275207655] [2019-10-13 21:33:34,187 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:34,188 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:34,188 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:34,188 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:34,188 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:34,237 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:34,472 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:34,479 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:34,481 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:34,482 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:34,482 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,482 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,482 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-13 21:33:34,482 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 116#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:34,483 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:34,483 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:34,483 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-13 21:33:34,483 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-13 21:33:34,483 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-13 21:33:34,484 INFO L193 IcfgInterpreter]: Reachable states at location L17 satisfy 121#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a2~0.base|) (+ (* main_~x~0 4) |main_~#a2~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem5|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:34,484 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:34,484 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a2~0.base_BEFORE_CALL_7| Int) (|v_main_~#a2~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a2~0.base_BEFORE_CALL_7|) |v_main_~#a2~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-13 21:33:34,484 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 111#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:35,133 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:35,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 57, 57, 11] total 142 [2019-10-13 21:33:35,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594489676] [2019-10-13 21:33:35,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-10-13 21:33:35,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-10-13 21:33:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6475, Invalid=13547, Unknown=0, NotChecked=0, Total=20022 [2019-10-13 21:33:35,139 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 142 states.