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_maxInArray_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:35:19,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:35:19,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:35:19,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:35:19,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:35:19,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:35:19,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:35:19,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:35:19,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:35:19,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:35:19,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:35:19,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:35:19,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:35:19,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:35:19,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:35:19,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:35:19,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:35:19,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:35:19,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:35:19,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:35:19,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:35:19,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:35:19,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:35:19,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:35:19,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:35:19,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:35:19,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:35:19,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:35:19,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:35:19,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:35:19,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:35:19,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:35:19,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:35:19,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:35:19,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:35:19,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:35:19,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:35:19,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:35:19,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:35:19,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:35:19,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:35:19,292 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:35:19,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:35:19,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:35:19,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:35:19,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:35:19,308 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:35:19,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:35:19,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:35:19,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:35:19,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:35:19,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:35:19,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:35:19,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:35:19,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:35:19,310 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:35:19,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:35:19,310 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:35:19,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:35:19,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:35:19,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:35:19,311 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:35:19,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:35:19,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:19,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:35:19,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:35:19,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:35:19,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:35:19,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:35:19,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:35:19,313 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:35:19,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:35:19,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:35:19,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:35:19,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:35:19,635 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:35:19,636 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-10-13 21:35:19,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2207e3bdf/e89eca9250dd4a839f9e140b84c1c132/FLAG8093debac [2019-10-13 21:35:20,161 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:35:20,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_ground.i [2019-10-13 21:35:20,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2207e3bdf/e89eca9250dd4a839f9e140b84c1c132/FLAG8093debac [2019-10-13 21:35:20,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2207e3bdf/e89eca9250dd4a839f9e140b84c1c132 [2019-10-13 21:35:20,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:35:20,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:35:20,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:20,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:35:20,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:35:20,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fb768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20, skipping insertion in model container [2019-10-13 21:35:20,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,573 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:35:20,590 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:35:20,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:20,799 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:35:20,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:35:20,836 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:35:20,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20 WrapperNode [2019-10-13 21:35:20,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:35:20,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:35:20,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:35:20,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:35:20,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... [2019-10-13 21:35:20,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:35:20,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:35:20,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:35:20,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:35:20,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:35:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:35:21,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:35:21,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:35:21,014 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:35:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:35:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:35:21,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:35:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:35:21,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:35:21,409 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:35:21,410 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:35:21,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:21 BoogieIcfgContainer [2019-10-13 21:35:21,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:35:21,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:35:21,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:35:21,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:35:21,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:35:20" (1/3) ... [2019-10-13 21:35:21,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0cd19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:21, skipping insertion in model container [2019-10-13 21:35:21,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:35:20" (2/3) ... [2019-10-13 21:35:21,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e0cd19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:35:21, skipping insertion in model container [2019-10-13 21:35:21,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:35:21" (3/3) ... [2019-10-13 21:35:21,419 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_ground.i [2019-10-13 21:35:21,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:35:21,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:35:21,448 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:35:21,472 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:35:21,472 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:35:21,472 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:35:21,472 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:35:21,473 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:35:21,473 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:35:21,473 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:35:21,473 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:35:21,488 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:35:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:35:21,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:21,495 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:21,497 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:21,502 INFO L82 PathProgramCache]: Analyzing trace with hash -493369724, now seen corresponding path program 1 times [2019-10-13 21:35:21,509 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:21,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098085367] [2019-10-13 21:35:21,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:21,665 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:35:21,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098085367] [2019-10-13 21:35:21,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:21,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:21,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062612512] [2019-10-13 21:35:21,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:21,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:21,685 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:35:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:21,724 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:35:21,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:21,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:35:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:21,733 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:35:21,734 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:35:21,737 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:35:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:35:21,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:35:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:35:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:35:21,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:35:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:21,773 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:35:21,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:35:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:35:21,774 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:21,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:21,775 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 937030386, now seen corresponding path program 1 times [2019-10-13 21:35:21,776 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:21,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471843115] [2019-10-13 21:35:21,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:21,821 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:35:21,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471843115] [2019-10-13 21:35:21,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:35:21,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:35:21,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957042030] [2019-10-13 21:35:21,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:35:21,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:35:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:35:21,828 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:35:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:21,841 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-13 21:35:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:35:21,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:35:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:21,843 INFO L225 Difference]: With dead ends: 27 [2019-10-13 21:35:21,844 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:35:21,845 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:35:21,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:35:21,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:35:21,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:35:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:35:21,851 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:35:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:21,851 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:35:21,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:35:21,851 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:35:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:35:21,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:21,852 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:21,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 76469094, now seen corresponding path program 1 times [2019-10-13 21:35:21,853 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:21,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712926912] [2019-10-13 21:35:21,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:21,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:21,922 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:35:21,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712926912] [2019-10-13 21:35:21,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536645299] [2019-10-13 21:35:21,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:21,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:21,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:22,010 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:35:22,010 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:22,054 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:35:22,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [842474543] [2019-10-13 21:35:22,107 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:22,110 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:22,118 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:22,124 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:22,125 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:22,294 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:22,575 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:22,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:22,639 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:22,639 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:22,640 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:22,640 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:22,641 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:22,641 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:22,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:22,643 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:35:22,643 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:35:22,643 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:22,643 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:22,644 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:22,644 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:22,645 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:22,645 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:23,018 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:23,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:35:23,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779233834] [2019-10-13 21:35:23,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:35:23,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:23,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:35:23,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:35:23,022 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:35:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:23,534 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-13 21:35:23,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:35:23,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:35:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:23,537 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:35:23,538 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 21:35:23,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:35:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 21:35:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-10-13 21:35:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:35:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-13 21:35:23,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2019-10-13 21:35:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:23,554 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-13 21:35:23,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:35:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-13 21:35:23,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:35:23,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:23,556 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:23,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:23,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 134362772, now seen corresponding path program 2 times [2019-10-13 21:35:23,761 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:23,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83595327] [2019-10-13 21:35:23,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:23,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:23,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:35:23,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83595327] [2019-10-13 21:35:23,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864021008] [2019-10-13 21:35:23,901 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:35:23,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:35:23,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:23,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:35:23,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:23,992 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:24,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203609397] [2019-10-13 21:35:24,035 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:24,035 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:24,036 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:24,036 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:24,038 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:24,095 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:24,271 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:24,299 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:24,311 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:24,312 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:24,312 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:24,312 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:24,313 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:24,313 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:24,314 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:24,314 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:35:24,314 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:35:24,315 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:24,315 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:24,315 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:24,316 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:24,316 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:24,316 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:24,668 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:24,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 21:35:24,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274764324] [2019-10-13 21:35:24,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:35:24,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:24,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:35:24,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:35:24,671 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2019-10-13 21:35:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:25,379 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-10-13 21:35:25,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:35:25,381 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-10-13 21:35:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:25,382 INFO L225 Difference]: With dead ends: 39 [2019-10-13 21:35:25,382 INFO L226 Difference]: Without dead ends: 28 [2019-10-13 21:35:25,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:35:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-13 21:35:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-13 21:35:25,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:35:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-13 21:35:25,392 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2019-10-13 21:35:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:25,392 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-13 21:35:25,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:35:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-13 21:35:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:35:25,393 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:25,393 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:25,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:25,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 717812850, now seen corresponding path program 3 times [2019-10-13 21:35:25,606 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:25,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938093571] [2019-10-13 21:35:25,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:25,607 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:25,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:25,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938093571] [2019-10-13 21:35:25,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435813263] [2019-10-13 21:35:25,717 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:35:25,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:25,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:25,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 21:35:25,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:25,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:25,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [656578174] [2019-10-13 21:35:25,922 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:25,922 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:25,923 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:25,924 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:25,924 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:25,972 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:26,172 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:26,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:26,201 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:26,202 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:26,202 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:26,203 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:26,203 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:26,203 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:26,204 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:26,204 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:35:26,204 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:35:26,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:26,205 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:26,205 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:26,206 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:26,206 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-13 21:35:26,207 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:26,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:26,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-13 21:35:26,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260494571] [2019-10-13 21:35:26,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:35:26,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:26,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:35:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:35:26,522 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 25 states. [2019-10-13 21:35:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:27,246 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-10-13 21:35:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 21:35:27,247 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-13 21:35:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:27,248 INFO L225 Difference]: With dead ends: 49 [2019-10-13 21:35:27,248 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 21:35:27,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:35:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 21:35:27,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-10-13 21:35:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:35:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:35:27,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-10-13 21:35:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:27,259 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:35:27,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:35:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:35:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:35:27,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:27,261 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:27,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:27,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1375752956, now seen corresponding path program 4 times [2019-10-13 21:35:27,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:27,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288002783] [2019-10-13 21:35:27,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:27,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:27,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:27,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288002783] [2019-10-13 21:35:27,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634372164] [2019-10-13 21:35:27,705 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:35:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:27,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 21:35:27,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:27,835 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:28,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1984196776] [2019-10-13 21:35:28,153 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:28,153 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:28,153 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:28,154 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:28,154 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:28,188 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:28,301 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:28,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:28,328 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:28,328 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:28,329 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:28,329 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:28,329 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:28,330 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:28,330 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:28,330 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:35:28,331 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:35:28,331 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:28,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:28,332 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:28,336 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:28,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:28,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:28,688 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:28,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-13 21:35:28,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244184484] [2019-10-13 21:35:28,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-13 21:35:28,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-13 21:35:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 21:35:28,691 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 39 states. [2019-10-13 21:35:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:30,022 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2019-10-13 21:35:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-13 21:35:30,023 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 28 [2019-10-13 21:35:30,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:30,024 INFO L225 Difference]: With dead ends: 63 [2019-10-13 21:35:30,024 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:35:30,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:35:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:35:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-10-13 21:35:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 21:35:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-13 21:35:30,044 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 28 [2019-10-13 21:35:30,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:30,044 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-13 21:35:30,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-13 21:35:30,045 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-13 21:35:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 21:35:30,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:30,046 INFO L380 BasicCegarLoop]: trace histogram [26, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:30,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:30,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:30,252 INFO L82 PathProgramCache]: Analyzing trace with hash -118694588, now seen corresponding path program 5 times [2019-10-13 21:35:30,252 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:30,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709139017] [2019-10-13 21:35:30,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:30,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:30,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 21:35:30,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709139017] [2019-10-13 21:35:30,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047187583] [2019-10-13 21:35:30,780 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:35:30,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:35:30,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:30,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:35:30,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:30,959 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-13 21:35:31,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269927007] [2019-10-13 21:35:31,090 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:31,091 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:31,091 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:31,091 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:31,092 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:31,110 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:31,179 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:31,190 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:31,194 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:31,194 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:31,195 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:31,195 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:31,195 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:31,195 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:31,196 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:31,196 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:35:31,196 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:35:31,196 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:31,196 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:31,197 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:31,197 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:31,197 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:31,197 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:31,657 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:31,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 7, 7, 11] total 49 [2019-10-13 21:35:31,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574828955] [2019-10-13 21:35:31,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-13 21:35:31,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:31,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-13 21:35:31,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=1852, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:35:31,662 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 49 states. [2019-10-13 21:35:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:34,153 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2019-10-13 21:35:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:35:34,153 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 42 [2019-10-13 21:35:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:34,154 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:35:34,154 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 21:35:34,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1899 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1514, Invalid=7042, Unknown=0, NotChecked=0, Total=8556 [2019-10-13 21:35:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 21:35:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-13 21:35:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 21:35:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-10-13 21:35:34,167 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2019-10-13 21:35:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:34,168 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-10-13 21:35:34,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-13 21:35:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-10-13 21:35:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 21:35:34,169 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:34,170 INFO L380 BasicCegarLoop]: trace histogram [27, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:34,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:34,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:34,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash 426553522, now seen corresponding path program 6 times [2019-10-13 21:35:34,375 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:34,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308504317] [2019-10-13 21:35:34,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:34,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:34,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:34,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308504317] [2019-10-13 21:35:34,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216486759] [2019-10-13 21:35:34,852 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:35:34,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:35:34,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:35:34,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:35:34,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:35,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:36,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [533985349] [2019-10-13 21:35:36,148 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:36,149 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:36,149 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:36,149 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:36,149 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:36,175 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:36,256 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:36,274 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:36,282 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:36,282 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:36,282 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:36,283 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:36,283 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:36,283 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:36,283 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:36,284 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:35:36,284 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:35:36,284 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:36,284 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:36,284 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:36,285 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:36,285 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:36,285 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:36,707 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:36,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-13 21:35:36,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64670294] [2019-10-13 21:35:36,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-13 21:35:36,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:36,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-13 21:35:36,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-13 21:35:36,711 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 69 states. [2019-10-13 21:35:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:40,072 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-13 21:35:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-13 21:35:40,074 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 49 [2019-10-13 21:35:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:40,075 INFO L225 Difference]: With dead ends: 105 [2019-10-13 21:35:40,075 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 21:35:40,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-13 21:35:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 21:35:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-10-13 21:35:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-13 21:35:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-13 21:35:40,093 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 49 [2019-10-13 21:35:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:40,094 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-13 21:35:40,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-13 21:35:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-13 21:35:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:35:40,096 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:40,097 INFO L380 BasicCegarLoop]: trace histogram [56, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:40,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:40,307 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1211031940, now seen corresponding path program 7 times [2019-10-13 21:35:40,308 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:40,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277953381] [2019-10-13 21:35:40,308 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:40,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:40,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:41,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277953381] [2019-10-13 21:35:41,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100191324] [2019-10-13 21:35:41,845 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:35:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:35:41,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-13 21:35:41,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:35:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:42,018 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:35:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:35:46,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486140328] [2019-10-13 21:35:46,146 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:35:46,146 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:35:46,147 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:35:46,147 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:35:46,147 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:35:46,180 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:35:46,238 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:35:46,252 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:35:46,255 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:35:46,255 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:35:46,255 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 114#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:35:46,256 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 104#(and (< main_~x~0 100000) (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,256 INFO L193 IcfgInterpreter]: Reachable states at location L14-2 satisfy 94#(and (<= 0 main_~i~0) (<= 100000 main_~j~0)) [2019-10-13 21:35:46,256 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 119#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,256 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 128#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:35:46,256 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:35:46,256 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:35:46,257 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 133#(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:35:46,257 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:35:46,257 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:35:46,257 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 99#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:35:46,257 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 124#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:35:46,258 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 109#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:35:46,825 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:35:46,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-13 21:35:46,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466899644] [2019-10-13 21:35:46,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-13 21:35:46,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:35:46,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-13 21:35:46,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-13 21:35:46,834 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 127 states. [2019-10-13 21:35:56,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:35:56,505 INFO L93 Difference]: Finished difference Result 163 states and 225 transitions. [2019-10-13 21:35:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-13 21:35:56,505 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 78 [2019-10-13 21:35:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:35:56,506 INFO L225 Difference]: With dead ends: 163 [2019-10-13 21:35:56,507 INFO L226 Difference]: Without dead ends: 143 [2019-10-13 21:35:56,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-13 21:35:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-13 21:35:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-10-13 21:35:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-13 21:35:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-13 21:35:56,530 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 78 [2019-10-13 21:35:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:35:56,531 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-13 21:35:56,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-13 21:35:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-13 21:35:56,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:35:56,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:35:56,535 INFO L380 BasicCegarLoop]: trace histogram [114, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:35:56,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:35:56,738 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:35:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:35:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2051514436, now seen corresponding path program 8 times [2019-10-13 21:35:56,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:35:56,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275207655] [2019-10-13 21:35:56,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:56,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:35:56,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:35:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat