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_copy2_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:33:25,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:33:25,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:33:25,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:33:25,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:33:25,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:33:25,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:33:25,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:33:25,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:33:25,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:33:25,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:33:25,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:33:25,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:33:25,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:33:25,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:33:25,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:33:25,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:33:25,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:33:25,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:33:25,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:33:25,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:33:25,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:33:25,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:33:25,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:33:25,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:33:25,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:33:25,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:33:25,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:33:25,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:33:25,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:33:25,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:33:25,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:33:25,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:33:25,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:33:25,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:33:25,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:33:25,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:33:25,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:33:25,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:33:25,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:33:25,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:33:25,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:33:25,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:33:25,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:33:25,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:33:25,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:33:25,278 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:33:25,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:33:25,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:33:25,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:33:25,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:33:25,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:33:25,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:33:25,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:33:25,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:33:25,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:33:25,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:33:25,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:33:25,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:33:25,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:33:25,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:33:25,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:33:25,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:33:25,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:25,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:33:25,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:33:25,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:33:25,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:33:25,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:33:25,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:33:25,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:33:25,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:33:25,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:33:25,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:33:25,569 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:33:25,570 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:33:25,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-1.i [2019-10-13 21:33:25,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed79c8d/ffcf9b7b9df44217b30c9fd8fa22cae8/FLAG1b4d8209b [2019-10-13 21:33:26,075 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:33:26,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_ground-1.i [2019-10-13 21:33:26,082 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed79c8d/ffcf9b7b9df44217b30c9fd8fa22cae8/FLAG1b4d8209b [2019-10-13 21:33:26,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eed79c8d/ffcf9b7b9df44217b30c9fd8fa22cae8 [2019-10-13 21:33:26,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:33:26,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:33:26,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:26,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:33:26,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:33:26,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5611840f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26, skipping insertion in model container [2019-10-13 21:33:26,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:33:26,526 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:33:26,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:26,696 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:33:26,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:33:26,734 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:33:26,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26 WrapperNode [2019-10-13 21:33:26,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:33:26,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:33:26,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:33:26,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:33:26,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... [2019-10-13 21:33:26,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:33:26,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:33:26,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:33:26,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:33:26,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:33:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:33:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:33:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:33:26,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:33:26,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:33:26,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:33:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:33:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:33:26,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:33:27,338 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:33:27,338 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-13 21:33:27,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27 BoogieIcfgContainer [2019-10-13 21:33:27,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:33:27,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:33:27,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:33:27,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:33:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:33:26" (1/3) ... [2019-10-13 21:33:27,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324f382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:33:26" (2/3) ... [2019-10-13 21:33:27,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324f382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:33:27, skipping insertion in model container [2019-10-13 21:33:27,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:33:27" (3/3) ... [2019-10-13 21:33:27,346 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy2_ground-1.i [2019-10-13 21:33:27,356 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:33:27,364 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:33:27,376 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:33:27,396 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:33:27,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:33:27,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:33:27,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:33:27,397 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:33:27,397 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:33:27,397 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:33:27,397 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:33:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-13 21:33:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:33:27,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,423 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,425 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1240250468, now seen corresponding path program 1 times [2019-10-13 21:33:27,440 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663412688] [2019-10-13 21:33:27,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:33:27,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663412688] [2019-10-13 21:33:27,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:27,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:27,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998391585] [2019-10-13 21:33:27,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:27,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:27,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:27,639 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-13 21:33:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:27,681 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-13 21:33:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:27,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:33:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:27,693 INFO L225 Difference]: With dead ends: 35 [2019-10-13 21:33:27,693 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:33:27,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:33:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:33:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:33:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-13 21:33:27,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-13 21:33:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:27,744 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-13 21:33:27,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-13 21:33:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:33:27,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,746 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,746 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,747 INFO L82 PathProgramCache]: Analyzing trace with hash 650913249, now seen corresponding path program 1 times [2019-10-13 21:33:27,747 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331072067] [2019-10-13 21:33:27,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,748 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:33:27,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331072067] [2019-10-13 21:33:27,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:33:27,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:33:27,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399024480] [2019-10-13 21:33:27,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:33:27,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:27,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:33:27,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:27,805 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-13 21:33:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:27,833 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:33:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:33:27,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:33:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:27,838 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:33:27,838 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:33:27,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:33:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:33:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:33:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:33:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-13 21:33:27,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-13 21:33:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:27,851 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-13 21:33:27,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:33:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-13 21:33:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:33:27,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:27,854 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:27,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash -586370056, now seen corresponding path program 1 times [2019-10-13 21:33:27,856 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:27,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154573390] [2019-10-13 21:33:27,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:27,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:27,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154573390] [2019-10-13 21:33:27,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842840869] [2019-10-13 21:33:27,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:28,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:33:28,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:28,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:28,096 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:33:28,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1911170584] [2019-10-13 21:33:28,197 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:28,197 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:28,210 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:28,219 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:28,220 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:28,385 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:28,900 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:29,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:29,313 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:29,321 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:29,321 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:29,321 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:29,322 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,322 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,323 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,323 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:29,323 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:29,323 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,324 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,324 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:29,324 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:29,324 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:29,325 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:29,325 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:33:29,326 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:29,744 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:29,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:33:29,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988399483] [2019-10-13 21:33:29,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:33:29,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:33:29,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:33:29,748 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 18 states. [2019-10-13 21:33:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:30,499 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-13 21:33:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:30,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 16 [2019-10-13 21:33:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:30,501 INFO L225 Difference]: With dead ends: 47 [2019-10-13 21:33:30,501 INFO L226 Difference]: Without dead ends: 34 [2019-10-13 21:33:30,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:33:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-13 21:33:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-13 21:33:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 21:33:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-13 21:33:30,510 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-13 21:33:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:30,510 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-13 21:33:30,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:33:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-13 21:33:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:33:30,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:30,512 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:30,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:30,716 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:30,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1834779132, now seen corresponding path program 2 times [2019-10-13 21:33:30,717 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:30,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992465171] [2019-10-13 21:33:30,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:30,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:30,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:30,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:30,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992465171] [2019-10-13 21:33:30,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991047838] [2019-10-13 21:33:30,826 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:30,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:33:30,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:30,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:33:30,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:30,904 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:33:30,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1459378593] [2019-10-13 21:33:30,932 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:30,933 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:30,933 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:30,934 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:30,934 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:30,973 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:31,564 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-13 21:33:31,644 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:31,657 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:31,664 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:31,664 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:31,665 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,665 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,666 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:31,666 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,666 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:31,667 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:31,667 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,667 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,668 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:31,668 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:31,668 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:31,668 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:31,669 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) [2019-10-13 21:33:31,669 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:31,949 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:31,949 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-13 21:33:31,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266429407] [2019-10-13 21:33:31,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:33:31,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:33:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:33:31,952 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 19 states. [2019-10-13 21:33:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:32,622 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2019-10-13 21:33:32,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 21:33:32,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-10-13 21:33:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:32,624 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:33:32,624 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 21:33:32,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:33:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 21:33:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2019-10-13 21:33:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 21:33:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-10-13 21:33:32,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2019-10-13 21:33:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:32,635 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-10-13 21:33:32,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:33:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-10-13 21:33:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:33:32,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:32,636 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:32,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:32,840 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash -12438844, now seen corresponding path program 3 times [2019-10-13 21:33:32,840 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:32,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180456605] [2019-10-13 21:33:32,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:32,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 21:33:33,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180456605] [2019-10-13 21:33:33,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503482654] [2019-10-13 21:33:33,003 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:33,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:33,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:33,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:33,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:33:33,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:33:33,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [381732430] [2019-10-13 21:33:33,246 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:33,246 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:33,247 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:33,247 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:33,247 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:33,275 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:33,811 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:33,820 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:33,824 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:33,825 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:33,825 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:33,825 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,825 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:33,825 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,826 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:33,827 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:33,827 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,827 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,827 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:33,827 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:33,828 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:33,828 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:33,828 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:33,828 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:33:34,165 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:34,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 11] total 29 [2019-10-13 21:33:34,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559541769] [2019-10-13 21:33:34,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-13 21:33:34,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-13 21:33:34,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-10-13 21:33:34,169 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 29 states. [2019-10-13 21:33:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:35,275 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2019-10-13 21:33:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-13 21:33:35,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-10-13 21:33:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:35,277 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:33:35,277 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 21:33:35,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 21:33:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-10-13 21:33:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-13 21:33:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-13 21:33:35,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 29 [2019-10-13 21:33:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:35,296 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-13 21:33:35,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-13 21:33:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-13 21:33:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 21:33:35,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:35,298 INFO L380 BasicCegarLoop]: trace histogram [10, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:35,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:35,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1328394821, now seen corresponding path program 4 times [2019-10-13 21:33:35,500 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:35,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121063993] [2019-10-13 21:33:35,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:35,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 21:33:35,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121063993] [2019-10-13 21:33:35,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002824013] [2019-10-13 21:33:35,685 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:35,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:35,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:33:35,884 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 21:33:36,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [107394498] [2019-10-13 21:33:36,106 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:36,106 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:36,107 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:36,107 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:36,107 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:36,145 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:36,622 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:36,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:36,646 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:36,646 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:36,646 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,647 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,647 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,647 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,647 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:36,648 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:36,648 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,648 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,648 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:36,648 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:36,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:36,649 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:36,649 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:36,649 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) [2019-10-13 21:33:36,998 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:36,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13, 11] total 42 [2019-10-13 21:33:36,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027149928] [2019-10-13 21:33:37,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-13 21:33:37,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:37,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-13 21:33:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 21:33:37,002 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 42 states. [2019-10-13 21:33:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:38,709 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2019-10-13 21:33:38,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-13 21:33:38,709 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 37 [2019-10-13 21:33:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:38,711 INFO L225 Difference]: With dead ends: 89 [2019-10-13 21:33:38,711 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 21:33:38,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1057, Invalid=5105, Unknown=0, NotChecked=0, Total=6162 [2019-10-13 21:33:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 21:33:38,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-13 21:33:38,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:33:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-13 21:33:38,723 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 37 [2019-10-13 21:33:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:38,723 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-13 21:33:38,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-13 21:33:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-13 21:33:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:33:38,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:38,725 INFO L380 BasicCegarLoop]: trace histogram [22, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:38,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:38,930 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash -296741436, now seen corresponding path program 5 times [2019-10-13 21:33:38,931 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:38,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468089711] [2019-10-13 21:33:38,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:38,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-13 21:33:39,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468089711] [2019-10-13 21:33:39,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566519392] [2019-10-13 21:33:39,319 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:40,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-13 21:33:40,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:33:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-13 21:33:40,415 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-10-13 21:33:40,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1947263622] [2019-10-13 21:33:40,633 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:40,633 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:40,634 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:40,634 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:40,634 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:40,655 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:41,157 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:41,163 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:41,167 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:41,167 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:41,167 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,167 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,168 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:41,168 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:41,168 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:41,168 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:41,169 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:33:41,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:41,169 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:41,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:41,169 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:41,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:41,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-13 21:33:41,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:41,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 11, 11] total 53 [2019-10-13 21:33:41,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436153824] [2019-10-13 21:33:41,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 21:33:41,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 21:33:41,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=2238, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 21:33:41,632 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 53 states. [2019-10-13 21:33:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:44,222 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2019-10-13 21:33:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 21:33:44,223 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 51 [2019-10-13 21:33:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:44,225 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:33:44,225 INFO L226 Difference]: Without dead ends: 85 [2019-10-13 21:33:44,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2431 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1584, Invalid=8516, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 21:33:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-13 21:33:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-10-13 21:33:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-13 21:33:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-10-13 21:33:44,239 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 51 [2019-10-13 21:33:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:44,240 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-10-13 21:33:44,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 21:33:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-10-13 21:33:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 21:33:44,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:44,242 INFO L380 BasicCegarLoop]: trace histogram [23, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:44,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1680385249, now seen corresponding path program 6 times [2019-10-13 21:33:44,448 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:44,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334481562] [2019-10-13 21:33:44,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,449 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:44,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:44,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334481562] [2019-10-13 21:33:44,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068181814] [2019-10-13 21:33:44,836 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:44,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:44,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:44,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 21:33:44,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:45,003 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:45,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [977579222] [2019-10-13 21:33:45,765 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:45,765 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:45,766 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:45,766 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:45,766 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:45,789 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:46,280 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:46,286 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:46,289 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:46,289 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:46,289 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,290 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,290 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:46,290 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,290 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:46,291 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:46,291 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,292 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:46,293 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:46,293 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:46,293 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:46,294 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:46,294 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-13 21:33:46,752 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:46,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 11] total 61 [2019-10-13 21:33:46,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328183661] [2019-10-13 21:33:46,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:33:46,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:33:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1304, Invalid=2356, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:33:46,756 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 61 states. [2019-10-13 21:33:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:49,345 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2019-10-13 21:33:49,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-13 21:33:49,346 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 72 [2019-10-13 21:33:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:49,347 INFO L225 Difference]: With dead ends: 157 [2019-10-13 21:33:49,348 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 21:33:49,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2979 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3807, Invalid=9533, Unknown=0, NotChecked=0, Total=13340 [2019-10-13 21:33:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 21:33:49,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2019-10-13 21:33:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-13 21:33:49,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-10-13 21:33:49,364 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 72 [2019-10-13 21:33:49,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:49,365 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2019-10-13 21:33:49,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:33:49,365 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2019-10-13 21:33:49,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:33:49,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:49,367 INFO L380 BasicCegarLoop]: trace histogram [48, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:49,576 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:49,577 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1702326076, now seen corresponding path program 7 times [2019-10-13 21:33:49,578 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:49,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186585535] [2019-10-13 21:33:49,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,579 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:49,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:50,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186585535] [2019-10-13 21:33:50,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446607425] [2019-10-13 21:33:50,647 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-13 21:33:50,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:50,870 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-13 21:33:53,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2087685098] [2019-10-13 21:33:53,451 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 21:33:53,451 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:53,451 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:53,452 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:53,452 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:53,475 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:53,966 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-13 21:33:53,975 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:53,978 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:53,978 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:53,978 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,978 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,978 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= (select (select |#memory_int| |main_~#a3~0.base|) (+ (* main_~x~0 4) |main_~#a3~0.offset|)) |main_#t~mem9|) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* main_~x~0 4) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:53,978 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,978 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:53,979 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:53,980 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) [2019-10-13 21:33:54,477 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:54,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 11] total 111 [2019-10-13 21:33:54,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937065934] [2019-10-13 21:33:54,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:33:54,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:33:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5079, Invalid=7131, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:54,487 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 111 states. [2019-10-13 21:34:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:34:01,940 INFO L93 Difference]: Finished difference Result 207 states and 262 transitions. [2019-10-13 21:34:01,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-10-13 21:34:01,940 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 97 [2019-10-13 21:34:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:34:01,942 INFO L225 Difference]: With dead ends: 207 [2019-10-13 21:34:01,943 INFO L226 Difference]: Without dead ends: 160 [2019-10-13 21:34:01,947 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9104 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15032, Invalid=31408, Unknown=0, NotChecked=0, Total=46440 [2019-10-13 21:34:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-10-13 21:34:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 151. [2019-10-13 21:34:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-13 21:34:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2019-10-13 21:34:01,965 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 97 [2019-10-13 21:34:01,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:34:01,965 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2019-10-13 21:34:01,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-13 21:34:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2019-10-13 21:34:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:34:01,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:34:01,968 INFO L380 BasicCegarLoop]: trace histogram [98, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:34:02,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:34:02,174 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:34:02,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:34:02,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2035697508, now seen corresponding path program 8 times [2019-10-13 21:34:02,175 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:34:02,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360981164] [2019-10-13 21:34:02,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,176 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:34:02,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:34:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:34:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5193 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 5022 trivial. 0 not checked. [2019-10-13 21:34:03,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360981164] [2019-10-13 21:34:03,476 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642503857] [2019-10-13 21:34:03,477 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true