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_compare_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:30:19,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:30:19,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:30:19,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:30:19,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:30:19,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:30:19,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:30:19,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:30:19,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:30:19,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:30:19,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:30:19,492 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:30:19,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:30:19,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:30:19,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:30:19,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:30:19,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:30:19,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:30:19,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:30:19,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:30:19,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:30:19,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:30:19,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:30:19,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:30:19,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:30:19,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:30:19,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:30:19,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:30:19,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:30:19,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:30:19,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:30:19,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:30:19,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:30:19,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:30:19,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:30:19,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:30:19,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:30:19,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:30:19,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:30:19,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:30:19,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:30:19,532 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-06 23:30:19,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:30:19,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:30:19,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:30:19,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:30:19,571 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:30:19,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:30:19,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:30:19,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:30:19,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:30:19,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:30:19,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:30:19,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:30:19,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:30:19,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:30:19,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:30:19,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:30:19,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:19,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:30:19,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:30:19,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:30:19,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:30:19,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:30:19,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:30:19,577 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-06 23:30:19,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:30:19,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:30:19,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:30:19,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:30:19,850 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:30:19,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-10-06 23:30:19,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc081ee47/3faf7e34383c400cb747be1b6da38e5f/FLAG69dbb124a [2019-10-06 23:30:20,361 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:30:20,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-10-06 23:30:20,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc081ee47/3faf7e34383c400cb747be1b6da38e5f/FLAG69dbb124a [2019-10-06 23:30:20,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc081ee47/3faf7e34383c400cb747be1b6da38e5f [2019-10-06 23:30:20,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:30:20,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:30:20,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:20,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:30:20,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:30:20,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:20" (1/1) ... [2019-10-06 23:30:20,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d92a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:20, skipping insertion in model container [2019-10-06 23:30:20,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:20" (1/1) ... [2019-10-06 23:30:20,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:30:20,822 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:30:21,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:21,039 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:30:21,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:21,092 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:30:21,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21 WrapperNode [2019-10-06 23:30:21,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:21,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:30:21,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:30:21,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:30:21,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (1/1) ... [2019-10-06 23:30:21,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:30:21,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:30:21,223 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:30:21,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:30:21,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (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-06 23:30:21,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:30:21,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:30:21,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:30:21,275 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:30:21,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:30:21,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:30:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:30:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:30:21,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:30:21,655 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:30:21,655 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-06 23:30:21,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:21 BoogieIcfgContainer [2019-10-06 23:30:21,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:30:21,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:30:21,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:30:21,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:30:21,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:30:20" (1/3) ... [2019-10-06 23:30:21,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59516b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:21, skipping insertion in model container [2019-10-06 23:30:21,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:21" (2/3) ... [2019-10-06 23:30:21,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59516b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:21, skipping insertion in model container [2019-10-06 23:30:21,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:21" (3/3) ... [2019-10-06 23:30:21,682 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_compare_ground.i [2019-10-06 23:30:21,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:30:21,700 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:30:21,708 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:30:21,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:30:21,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:30:21,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:30:21,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:30:21,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:30:21,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:30:21,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:30:21,729 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:30:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:30:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:30:21,750 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:21,751 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:21,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1664756858, now seen corresponding path program 1 times [2019-10-06 23:30:21,764 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:21,765 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:21,765 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:21,765 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:21,914 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-06 23:30:21,914 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:21,915 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:21,915 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:21,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:21,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:21,933 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-06 23:30:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:21,970 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-06 23:30:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:21,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:30:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:21,987 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:30:21,987 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:30:21,993 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:30:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:30:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:30:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-06 23:30:22,045 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-06 23:30:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:22,047 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-06 23:30:22,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-06 23:30:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:30:22,049 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:22,049 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:22,049 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1165016204, now seen corresponding path program 1 times [2019-10-06 23:30:22,050 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:22,050 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:22,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:22,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:22,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:22,110 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-06 23:30:22,111 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:22,111 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:22,112 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:22,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:22,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:22,114 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-06 23:30:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:22,132 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2019-10-06 23:30:22,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:22,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:30:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:22,135 INFO L225 Difference]: With dead ends: 29 [2019-10-06 23:30:22,135 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:30:22,136 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:30:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:30:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:30:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-06 23:30:22,141 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-06 23:30:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:22,141 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-06 23:30:22,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-06 23:30:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-06 23:30:22,142 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:22,143 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:22,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash -695054757, now seen corresponding path program 1 times [2019-10-06 23:30:22,144 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:22,144 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:22,144 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:22,145 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:22,230 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:22,231 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:22,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:22,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:22,347 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:30:22,386 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:22,408 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:22,409 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:22,415 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:22,422 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:22,423 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:22,580 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:22,924 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:22,941 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:22,951 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:22,951 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:22,951 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:22,953 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:22,953 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:22,953 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:22,954 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:22,954 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:22,954 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-06 23:30:22,955 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-06 23:30:22,955 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:22,956 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:22,956 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:22,957 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:22,957 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) |v_main_~#b~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (not (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_4) v_prenex_3))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:30:22,958 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:23,408 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:23,408 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-06 23:30:23,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:30:23,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:30:23,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:30:23,412 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 18 states. [2019-10-06 23:30:24,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:24,083 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2019-10-06 23:30:24,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:30:24,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-10-06 23:30:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:24,085 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:30:24,085 INFO L226 Difference]: Without dead ends: 31 [2019-10-06 23:30:24,086 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:30:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-06 23:30:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2019-10-06 23:30:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:30:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-06 23:30:24,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-06 23:30:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-06 23:30:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:30:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-06 23:30:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:30:24,095 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:24,095 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:24,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:24,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:24,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1936234603, now seen corresponding path program 2 times [2019-10-06 23:30:24,310 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:24,311 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:24,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:24,311 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:24,416 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:24,416 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:24,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:24,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:30:24,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:24,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:24,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:24,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:24,508 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:24,511 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:24,511 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:24,512 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:24,512 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:24,513 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:24,564 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:24,747 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:24,758 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:24,764 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:24,764 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:24,764 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,765 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,765 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:24,765 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:24,766 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:24,766 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:24,766 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-06 23:30:24,766 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-06 23:30:24,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:24,767 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:24,767 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:24,767 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:24,768 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) v_prenex_8)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) |v_main_~#b~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:30:24,768 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:25,163 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:25,163 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 12] total 18 [2019-10-06 23:30:25,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:30:25,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:30:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:30:25,165 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 18 states. [2019-10-06 23:30:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:25,774 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-06 23:30:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-06 23:30:25,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-10-06 23:30:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:25,775 INFO L225 Difference]: With dead ends: 44 [2019-10-06 23:30:25,775 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:30:25,776 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2019-10-06 23:30:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:30:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-06 23:30:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:30:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-10-06 23:30:25,784 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2019-10-06 23:30:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:25,787 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-10-06 23:30:25,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:30:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-10-06 23:30:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:30:25,790 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:25,790 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:25,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:25,991 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 62974394, now seen corresponding path program 3 times [2019-10-06 23:30:25,992 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:25,993 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:25,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:25,993 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:26,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:26,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:26,102 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:26,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:26,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:26,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:30:26,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:26,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-06 23:30:26,295 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:26,297 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:26,297 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:26,297 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:26,298 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:26,298 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:26,339 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:26,509 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:26,517 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:26,521 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:26,521 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:26,522 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,525 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,526 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:26,526 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:26,526 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:26,526 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:26,526 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-06 23:30:26,527 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-06 23:30:26,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:26,527 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:26,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:26,527 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:26,528 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) |v_main_~#b~0.offset_BEFORE_CALL_3|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_12) v_prenex_11))))) [2019-10-06 23:30:26,528 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:27,019 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:27,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 28 [2019-10-06 23:30:27,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-06 23:30:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-06 23:30:27,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-10-06 23:30:27,022 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 28 states. [2019-10-06 23:30:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:28,131 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-06 23:30:28,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-06 23:30:28,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 21 [2019-10-06 23:30:28,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:28,133 INFO L225 Difference]: With dead ends: 56 [2019-10-06 23:30:28,133 INFO L226 Difference]: Without dead ends: 41 [2019-10-06 23:30:28,135 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=364, Invalid=2186, Unknown=0, NotChecked=0, Total=2550 [2019-10-06 23:30:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-06 23:30:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-10-06 23:30:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-06 23:30:28,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-06 23:30:28,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2019-10-06 23:30:28,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:28,151 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-06 23:30:28,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-06 23:30:28,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-06 23:30:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:30:28,152 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:28,152 INFO L385 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:28,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:28,360 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1767947029, now seen corresponding path program 4 times [2019-10-06 23:30:28,360 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:28,361 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:28,361 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:28,361 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:28,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:30:28,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:28,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:28,553 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:28,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:30:28,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:30:28,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-06 23:30:29,003 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:29,005 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:29,005 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:29,008 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:29,008 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:29,008 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:29,050 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:29,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:29,299 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:29,305 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:29,305 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:29,306 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:29,306 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:29,307 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:29,307 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:29,308 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:29,308 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:29,308 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-06 23:30:29,309 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-06 23:30:29,309 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:29,309 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:29,310 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:29,310 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:29,311 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) v_prenex_15) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) |v_main_~#b~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:30:29,311 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:29,779 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:29,779 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 12] total 36 [2019-10-06 23:30:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-06 23:30:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-06 23:30:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=926, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:30:29,782 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 36 states. [2019-10-06 23:30:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:31,074 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2019-10-06 23:30:31,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-06 23:30:31,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 28 [2019-10-06 23:30:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:31,076 INFO L225 Difference]: With dead ends: 69 [2019-10-06 23:30:31,077 INFO L226 Difference]: Without dead ends: 53 [2019-10-06 23:30:31,079 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=949, Invalid=3341, Unknown=0, NotChecked=0, Total=4290 [2019-10-06 23:30:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-06 23:30:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2019-10-06 23:30:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-06 23:30:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-10-06 23:30:31,096 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 28 [2019-10-06 23:30:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:31,097 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-10-06 23:30:31,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-06 23:30:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-10-06 23:30:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-06 23:30:31,103 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:31,103 INFO L385 BasicCegarLoop]: trace histogram [22, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:31,305 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:31,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -7782507, now seen corresponding path program 5 times [2019-10-06 23:30:31,307 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:31,307 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:31,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:31,307 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:30:31,432 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:31,433 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:31,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:31,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:30:31,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:31,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:30:31,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:30:31,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-06 23:30:31,650 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:31,652 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:31,652 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:31,657 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:31,657 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:31,657 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:31,692 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:31,820 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:31,831 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:31,835 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:31,835 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:31,836 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,838 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,839 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:31,839 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:31,839 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:31,839 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,839 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-06 23:30:31,840 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-06 23:30:31,840 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:31,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:31,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:31,840 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) v_prenex_19))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) |v_main_~#b~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:30:31,841 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:32,170 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:32,170 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 12] total 26 [2019-10-06 23:30:32,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-06 23:30:32,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-06 23:30:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2019-10-06 23:30:32,173 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 26 states. [2019-10-06 23:30:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:33,084 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-10-06 23:30:33,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-06 23:30:33,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 40 [2019-10-06 23:30:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:33,085 INFO L225 Difference]: With dead ends: 70 [2019-10-06 23:30:33,085 INFO L226 Difference]: Without dead ends: 60 [2019-10-06 23:30:33,086 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=408, Invalid=1662, Unknown=0, NotChecked=0, Total=2070 [2019-10-06 23:30:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-06 23:30:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2019-10-06 23:30:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-06 23:30:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-06 23:30:33,099 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 40 [2019-10-06 23:30:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:33,099 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-06 23:30:33,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-06 23:30:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-06 23:30:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-06 23:30:33,100 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:33,101 INFO L385 BasicCegarLoop]: trace histogram [22, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:33,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:33,310 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 570589306, now seen corresponding path program 6 times [2019-10-06 23:30:33,311 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:33,312 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:33,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:33,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:33,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:30:33,641 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:33,641 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:33,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:33,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:33,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:33,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:30:33,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:30:33,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:30:34,553 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:34,555 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:34,556 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:34,556 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:34,556 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:34,557 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:34,592 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:34,722 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:34,729 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:34,732 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:34,733 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:34,733 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,733 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,734 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:34,738 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:34,740 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:34,740 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:34,741 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-06 23:30:34,741 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-06 23:30:34,741 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:34,741 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:34,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:34,742 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:34,742 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) |v_main_~#b~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_24) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_21)))))) [2019-10-06 23:30:34,742 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:35,194 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:35,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 12] total 60 [2019-10-06 23:30:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-06 23:30:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-06 23:30:35,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1210, Invalid=2330, Unknown=0, NotChecked=0, Total=3540 [2019-10-06 23:30:35,199 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 60 states. [2019-10-06 23:30:37,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:37,977 INFO L93 Difference]: Finished difference Result 107 states and 134 transitions. [2019-10-06 23:30:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-06 23:30:37,978 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 47 [2019-10-06 23:30:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:37,980 INFO L225 Difference]: With dead ends: 107 [2019-10-06 23:30:37,980 INFO L226 Difference]: Without dead ends: 84 [2019-10-06 23:30:37,984 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3529, Invalid=9353, Unknown=0, NotChecked=0, Total=12882 [2019-10-06 23:30:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-06 23:30:37,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2019-10-06 23:30:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-06 23:30:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2019-10-06 23:30:37,995 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 47 [2019-10-06 23:30:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:37,996 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2019-10-06 23:30:37,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-06 23:30:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2019-10-06 23:30:37,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-06 23:30:37,998 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:37,998 INFO L385 BasicCegarLoop]: trace histogram [46, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:38,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:38,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:38,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:38,203 INFO L82 PathProgramCache]: Analyzing trace with hash 741709690, now seen corresponding path program 7 times [2019-10-06 23:30:38,203 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:38,203 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,204 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,204 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:30:38,531 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:38,531 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:38,531 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:38,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:30:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:30:39,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1159 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-06 23:30:42,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:42,440 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:42,440 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:42,441 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:42,441 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:42,441 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:42,464 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:42,609 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:42,614 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:42,618 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:42,618 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:42,618 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,618 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,619 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:42,619 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:30:42,619 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:30:42,619 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:42,619 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-06 23:30:42,619 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-06 23:30:42,620 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:30:42,620 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:42,620 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:42,620 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:42,620 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_27 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#b~0.offset_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (or (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) |v_main_~#b~0.offset_BEFORE_CALL_7|)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_27) v_prenex_25) (select (select |#memory_int| v_prenex_28) v_prenex_26)))))) [2019-10-06 23:30:42,621 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:43,258 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:43,258 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 49, 49, 12] total 120 [2019-10-06 23:30:43,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-10-06 23:30:43,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-10-06 23:30:43,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4698, Invalid=9582, Unknown=0, NotChecked=0, Total=14280 [2019-10-06 23:30:43,266 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 120 states. [2019-10-06 23:30:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:52,043 INFO L93 Difference]: Finished difference Result 156 states and 208 transitions. [2019-10-06 23:30:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2019-10-06 23:30:52,043 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 71 [2019-10-06 23:30:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:52,046 INFO L225 Difference]: With dead ends: 156 [2019-10-06 23:30:52,046 INFO L226 Difference]: Without dead ends: 133 [2019-10-06 23:30:52,056 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11899 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14114, Invalid=40876, Unknown=0, NotChecked=0, Total=54990 [2019-10-06 23:30:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-06 23:30:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-10-06 23:30:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-06 23:30:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-10-06 23:30:52,073 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 71 [2019-10-06 23:30:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:52,074 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-10-06 23:30:52,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-10-06 23:30:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-10-06 23:30:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-06 23:30:52,076 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:52,076 INFO L385 BasicCegarLoop]: trace histogram [94, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:52,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:52,288 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:52,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1903496469, now seen corresponding path program 8 times [2019-10-06 23:30:52,289 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:52,290 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:52,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:52,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-06 23:30:56,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:56,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:56,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:56,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:30:56,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:56,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-06 23:30:56,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:30:57,055 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-10-06 23:30:57,816 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:57,818 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:57,818 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:57,818 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:57,818 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:57,818 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:57,837 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:57,986 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:57,992 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:57,995 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:57,995 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:57,995 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:57,995 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (<= __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-06 23:30:57,996 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:57,996 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 121#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0)) [2019-10-06 23:30:57,996 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 116#(and (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (= 1 main_~rv~0) (not (< main_~j~0 100000)) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (<= 0 main_~i~0) (<= 1 main_~rv~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= main_~i~0 0)))) [2019-10-06 23:30:57,997 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 131#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0) (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (= 0 main_~rv~0))) [2019-10-06 23:30:57,997 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-06 23:30:57,997 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-06 23:30:57,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(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-06 23:30:57,997 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:57,997 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:57,997 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) (<= __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-06 23:30:57,998 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(exists ((|v_main_~#b~0.offset_BEFORE_CALL_8| Int) (v_prenex_29 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_30) v_prenex_32) (select (select |#memory_int| v_prenex_31) v_prenex_29))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) |v_main_~#b~0.offset_BEFORE_CALL_8|)))))) [2019-10-06 23:30:57,998 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 126#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:58,955 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:58,955 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 16, 16, 12] total 136 [2019-10-06 23:30:58,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-10-06 23:30:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-10-06 23:30:58,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5124, Invalid=13236, Unknown=0, NotChecked=0, Total=18360 [2019-10-06 23:30:58,959 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 136 states. [2019-10-06 23:31:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:11,053 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2019-10-06 23:31:11,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2019-10-06 23:31:11,054 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 120 [2019-10-06 23:31:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:11,056 INFO L225 Difference]: With dead ends: 173 [2019-10-06 23:31:11,056 INFO L226 Difference]: Without dead ends: 149 [2019-10-06 23:31:11,065 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14657 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=15422, Invalid=55600, Unknown=0, NotChecked=0, Total=71022 [2019-10-06 23:31:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-06 23:31:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2019-10-06 23:31:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-10-06 23:31:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-10-06 23:31:11,082 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 120 [2019-10-06 23:31:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:11,083 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-10-06 23:31:11,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-10-06 23:31:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-10-06 23:31:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-06 23:31:11,085 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:11,085 INFO L385 BasicCegarLoop]: trace histogram [95, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:11,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:11,300 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:11,300 INFO L82 PathProgramCache]: Analyzing trace with hash -160597260, now seen corresponding path program 9 times [2019-10-06 23:31:11,301 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:11,301 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:11,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:11,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4966 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-10-06 23:31:12,205 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:12,206 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:12,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:12,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:12,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:12,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 97 conjunts are in the unsatisfiable core [2019-10-06 23:31:12,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4966 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-06 23:31:16,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4966 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-10-06 23:31:27,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:27,776 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:31:27,776 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:27,776 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:27,777 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:27,777 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:27,809 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:27,923 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:27,930 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:27,933 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:27,933 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:27,933 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((v_prenex_34 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_33) v_prenex_36))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:27,933 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((v_prenex_34 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_33) v_prenex_36))))) (<= __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-06 23:31:27,934 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:27,934 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:31:27,937 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:31:27,938 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:27,938 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-06 23:31:27,938 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-06 23:31:27,938 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:31:27,938 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:31:27,939 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:27,939 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((v_prenex_34 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_33) v_prenex_36))))) (<= __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-06 23:31:27,939 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((v_prenex_34 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) |v_main_~#b~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_34) v_prenex_35) (select (select |#memory_int| v_prenex_33) v_prenex_36))))) [2019-10-06 23:31:27,939 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:28,977 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:28,977 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 98, 98, 12] total 234 [2019-10-06 23:31:28,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 234 states [2019-10-06 23:31:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2019-10-06 23:31:28,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19219, Invalid=35303, Unknown=0, NotChecked=0, Total=54522 [2019-10-06 23:31:28,983 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 234 states. [2019-10-06 23:31:58,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:58,654 INFO L93 Difference]: Finished difference Result 286 states and 387 transitions. [2019-10-06 23:31:58,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2019-10-06 23:31:58,655 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 136 [2019-10-06 23:31:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:58,657 INFO L225 Difference]: With dead ends: 286 [2019-10-06 23:31:58,657 INFO L226 Difference]: Without dead ends: 247 [2019-10-06 23:31:58,662 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 461 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44024 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=57709, Invalid=156197, Unknown=0, NotChecked=0, Total=213906 [2019-10-06 23:31:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-06 23:31:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2019-10-06 23:31:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-06 23:31:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 240 transitions. [2019-10-06 23:31:58,685 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 240 transitions. Word has length 136 [2019-10-06 23:31:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:58,685 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 240 transitions. [2019-10-06 23:31:58,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 234 states. [2019-10-06 23:31:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 240 transitions. [2019-10-06 23:31:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-06 23:31:58,689 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:58,690 INFO L385 BasicCegarLoop]: trace histogram [192, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:58,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:58,906 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:58,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash -900387115, now seen corresponding path program 10 times [2019-10-06 23:31:58,907 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:58,907 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:58,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:58,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 18963 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-06 23:32:13,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:13,485 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:32:13,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:32:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1717 conjuncts, 194 conjunts are in the unsatisfiable core [2019-10-06 23:32:13,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:32:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 18963 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-06 23:32:14,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18963 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-06 23:32:53,510 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:53,511 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:32:53,511 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:53,511 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:53,512 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:53,512 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:53,532 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:53,653 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:53,658 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:53,661 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:53,662 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:53,662 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 141#(and (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:53,662 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 146#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (<= 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-06 23:32:53,662 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:53,662 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 121#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0)) [2019-10-06 23:32:53,663 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 116#(and (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (= 1 main_~rv~0) (not (< main_~j~0 100000)) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (<= 0 main_~i~0) (<= 1 main_~rv~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= main_~i~0 0)))) [2019-10-06 23:32:53,663 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 131#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0) (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (= 0 main_~rv~0))) [2019-10-06 23:32:53,663 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-06 23:32:53,663 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-06 23:32:53,663 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(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-06 23:32:53,664 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:32:53,664 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:53,664 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) (<= 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-06 23:32:53,664 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(exists ((v_prenex_38 Int) (v_prenex_37 Int) (|v_main_~#b~0.offset_BEFORE_CALL_10| Int) (v_prenex_39 Int) (v_prenex_40 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_39) v_prenex_38) (select (select |#memory_int| v_prenex_40) v_prenex_37)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) |v_main_~#b~0.offset_BEFORE_CALL_10|))))) [2019-10-06 23:32:53,664 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 126#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:55,134 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:55,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [195, 195, 195, 12] total 400 [2019-10-06 23:32:55,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 400 states [2019-10-06 23:32:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 400 interpolants. [2019-10-06 23:32:55,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75500, Invalid=84100, Unknown=0, NotChecked=0, Total=159600 [2019-10-06 23:32:55,146 INFO L87 Difference]: Start difference. First operand 238 states and 240 transitions. Second operand 400 states. [2019-10-06 23:34:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:34:25,650 INFO L93 Difference]: Finished difference Result 481 states and 678 transitions. [2019-10-06 23:34:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 399 states. [2019-10-06 23:34:25,651 INFO L78 Accepts]: Start accepts. Automaton has 400 states. Word has length 234 [2019-10-06 23:34:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:34:25,654 INFO L225 Difference]: With dead ends: 481 [2019-10-06 23:34:25,654 INFO L226 Difference]: Without dead ends: 441 [2019-10-06 23:34:25,667 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 792 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106784 ImplicationChecksByTransitivity, 138.5s TimeCoverageRelationStatistics Valid=225719, Invalid=403923, Unknown=0, NotChecked=0, Total=629642 [2019-10-06 23:34:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-06 23:34:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 432. [2019-10-06 23:34:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-06 23:34:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 434 transitions. [2019-10-06 23:34:25,690 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 434 transitions. Word has length 234 [2019-10-06 23:34:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:34:25,691 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 434 transitions. [2019-10-06 23:34:25,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 400 states. [2019-10-06 23:34:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 434 transitions. [2019-10-06 23:34:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-10-06 23:34:25,700 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:34:25,700 INFO L385 BasicCegarLoop]: trace histogram [386, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:34:25,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:34:25,906 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:34:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:34:25,906 INFO L82 PathProgramCache]: Analyzing trace with hash 10084245, now seen corresponding path program 11 times [2019-10-06 23:34:25,907 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:34:25,907 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:34:25,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:25,907 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:34:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:34:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:35:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 75126 backedges. 0 proven. 74691 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-06 23:35:23,274 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:35:23,274 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:35:23,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:35:34,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-06 23:35:34,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:35:34,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-06 23:35:34,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:35:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 75126 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 74691 trivial. 0 not checked. [2019-10-06 23:35:39,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:35:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 75126 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 74691 trivial. 0 not checked. [2019-10-06 23:35:45,188 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:35:45,190 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:35:45,190 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:35:45,190 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:35:45,191 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:35:45,191 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:35:45,214 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:35:45,330 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:35:45,337 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:35:45,339 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:35:45,339 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:35:45,339 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 125#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_11| Int) (|v_main_~#b~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int) (|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_44) v_prenex_42) (select (select |#memory_int| v_prenex_43) v_prenex_41)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) |v_main_~#b~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) |v_main_~#a~0.offset_BEFORE_CALL_11|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 130#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_11| Int) (|v_main_~#b~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int) (|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_44) v_prenex_42) (select (select |#memory_int| v_prenex_43) v_prenex_41)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) |v_main_~#b~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) |v_main_~#a~0.offset_BEFORE_CALL_11|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 139#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 105#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1)) [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 100#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1)) [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 115#(and (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:35:45,340 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-06 23:35:45,340 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-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 144#(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-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:35:45,340 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:35:45,341 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 135#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_11| Int) (|v_main_~#b~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int) (|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_44) v_prenex_42) (select (select |#memory_int| v_prenex_43) v_prenex_41)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) |v_main_~#b~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) |v_main_~#a~0.offset_BEFORE_CALL_11|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:35:45,341 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 120#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_11| Int) (|v_main_~#b~0.offset_BEFORE_CALL_11| Int) (v_prenex_44 Int) (v_prenex_41 Int) (v_prenex_43 Int) (v_prenex_42 Int) (|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_44) v_prenex_42) (select (select |#memory_int| v_prenex_43) v_prenex_41)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) |v_main_~#b~0.offset_BEFORE_CALL_11|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) |v_main_~#a~0.offset_BEFORE_CALL_11|))))) [2019-10-06 23:35:45,341 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 110#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:35:48,075 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:35:48,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [389, 32, 32, 12] total 460 [2019-10-06 23:35:48,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 460 states [2019-10-06 23:35:48,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 460 interpolants. [2019-10-06 23:35:48,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77390, Invalid=133750, Unknown=0, NotChecked=0, Total=211140 [2019-10-06 23:35:48,088 INFO L87 Difference]: Start difference. First operand 432 states and 434 transitions. Second operand 460 states. [2019-10-06 23:36:12,801 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-06 23:37:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:37:55,536 INFO L93 Difference]: Finished difference Result 513 states and 548 transitions. [2019-10-06 23:37:55,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 460 states. [2019-10-06 23:37:55,537 INFO L78 Accepts]: Start accepts. Automaton has 460 states. Word has length 428 [2019-10-06 23:37:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:37:55,540 INFO L225 Difference]: With dead ends: 513 [2019-10-06 23:37:55,540 INFO L226 Difference]: Without dead ends: 473 [2019-10-06 23:37:55,556 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2128 GetRequests, 1215 SyntacticMatches, 0 SemanticMatches, 913 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145727 ImplicationChecksByTransitivity, 182.1s TimeCoverageRelationStatistics Valid=232284, Invalid=604026, Unknown=0, NotChecked=0, Total=836310 [2019-10-06 23:37:55,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-10-06 23:37:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 464. [2019-10-06 23:37:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-10-06 23:37:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 466 transitions. [2019-10-06 23:37:55,581 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 466 transitions. Word has length 428 [2019-10-06 23:37:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:37:55,581 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 466 transitions. [2019-10-06 23:37:55,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 460 states. [2019-10-06 23:37:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 466 transitions. [2019-10-06 23:37:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-10-06 23:37:55,584 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:37:55,585 INFO L385 BasicCegarLoop]: trace histogram [387, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:37:55,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:37:55,798 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:37:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:37:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash -715098508, now seen corresponding path program 12 times [2019-10-06 23:37:55,799 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:37:55,799 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:55,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:55,800 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:37:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 76908 backedges. 0 proven. 75078 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-06 23:38:53,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:53,273 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:53,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:54,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:38:54,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:38:54,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 3401 conjuncts, 389 conjunts are in the unsatisfiable core [2019-10-06 23:38:54,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 76908 backedges. 0 proven. 75078 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-06 23:38:54,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:41:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 76908 backedges. 0 proven. 75078 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-10-06 23:41:36,028 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:41:36,029 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:41:36,029 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:41:36,030 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:41:36,030 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:41:36,030 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:41:36,043 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:41:38,183 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:41:38,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:41:38,196 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:41:38,197 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:41:38,197 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 143#(and (exists ((|v_main_~#b~0.offset_BEFORE_CALL_12| Int) (v_prenex_48 Int) (|v_main_~#a~0.offset_BEFORE_CALL_12| Int) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int) (|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_47) v_prenex_45) (select (select |#memory_int| v_prenex_48) v_prenex_46))) (and (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) |v_main_~#b~0.offset_BEFORE_CALL_12|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) |v_main_~#a~0.offset_BEFORE_CALL_12|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:41:38,197 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 148#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.offset_BEFORE_CALL_12| Int) (v_prenex_48 Int) (|v_main_~#a~0.offset_BEFORE_CALL_12| Int) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int) (|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_47) v_prenex_45) (select (select |#memory_int| v_prenex_48) v_prenex_46))) (and (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) |v_main_~#b~0.offset_BEFORE_CALL_12|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) |v_main_~#a~0.offset_BEFORE_CALL_12|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:41:38,198 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 157#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:41:38,198 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 123#(and (<= 0 main_~i~0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0)) [2019-10-06 23:41:38,198 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 118#(and (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (= 1 main_~rv~0) (not (< main_~j~0 100000)) (= main_~i~0 0))) (or (and (<= 0 main_~i~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= 0 main_~rv~0)) (and (<= 0 main_~i~0) (<= 1 main_~rv~0) (<= 100000 main_~j~0) (<= main_~rv~0 1) (<= main_~i~0 0)))) [2019-10-06 23:41:38,198 INFO L193 IcfgInterpreter]: Reachable states at location L25 satisfy 133#(and (<= 0 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0) (< main_~x~0 100000) (= |main_#t~mem7| (select (select |#memory_int| |main_~#b~0.base|) (+ (* 4 main_~x~0) |main_~#b~0.offset|))) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem6|) (= main_~x~0 0) (<= 100000 main_~i~0) (not (= 0 main_~rv~0))) [2019-10-06 23:41:38,198 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-06 23:41:38,198 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-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 162#(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-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 74#true [2019-10-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 153#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#b~0.offset_BEFORE_CALL_12| Int) (v_prenex_48 Int) (|v_main_~#a~0.offset_BEFORE_CALL_12| Int) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int) (|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_47) v_prenex_45) (select (select |#memory_int| v_prenex_48) v_prenex_46))) (and (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) |v_main_~#b~0.offset_BEFORE_CALL_12|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) |v_main_~#a~0.offset_BEFORE_CALL_12|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 138#(exists ((|v_main_~#b~0.offset_BEFORE_CALL_12| Int) (v_prenex_48 Int) (|v_main_~#a~0.offset_BEFORE_CALL_12| Int) (v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int) (|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_47) v_prenex_45) (select (select |#memory_int| v_prenex_48) v_prenex_46))) (and (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) |v_main_~#b~0.offset_BEFORE_CALL_12|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) |v_main_~#a~0.offset_BEFORE_CALL_12|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:41:38,199 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 128#(and (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (not (= 0 main_~rv~0)) (<= main_~rv~0 1) (<= 0 main_~rv~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:41:40,942 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:41:40,942 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [390, 390, 390, 12] total 790 [2019-10-06 23:41:40,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 790 states [2019-10-06 23:41:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 790 interpolants. [2019-10-06 23:41:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303065, Invalid=320245, Unknown=0, NotChecked=0, Total=623310 [2019-10-06 23:41:40,996 INFO L87 Difference]: Start difference. First operand 464 states and 466 transitions. Second operand 790 states.