java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:30:27,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:30:27,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:30:27,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:30:27,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:30:27,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:30:27,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:30:27,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:30:27,594 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:30:27,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:30:27,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:30:27,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:30:27,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:30:27,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:30:27,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:30:27,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:30:27,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:30:27,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:30:27,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:30:27,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:30:27,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:30:27,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:30:27,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:30:27,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:30:27,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:30:27,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:30:27,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:30:27,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:30:27,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:30:27,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:30:27,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:30:27,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:30:27,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:30:27,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:30:27,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:30:27,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:30:27,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:30:27,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:30:27,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:30:27,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:30:27,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:30:27,631 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:27,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:30:27,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:30:27,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:30:27,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:30:27,653 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:30:27,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:30:27,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:30:27,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:30:27,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:30:27,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:30:27,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:30:27,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:30:27,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:30:27,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:30:27,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:30:27,656 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:30:27,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:30:27,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:30:27,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:30:27,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:30:27,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:30:27,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:30:27,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:30:27,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:30:27,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:30:27,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:30:27,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:30:27,659 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:30:27,659 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:27,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:30:27,968 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:30:27,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:30:27,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:30:27,973 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:30:27,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy2_ground-1.i [2019-10-06 23:30:28,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8681dc1ae/5cb9aeedea7044fd94218ea4e3a09976/FLAG929e2048e [2019-10-06 23:30:28,509 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:30:28,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy2_ground-1.i [2019-10-06 23:30:28,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8681dc1ae/5cb9aeedea7044fd94218ea4e3a09976/FLAG929e2048e [2019-10-06 23:30:28,874 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8681dc1ae/5cb9aeedea7044fd94218ea4e3a09976 [2019-10-06 23:30:28,883 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:30:28,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:30:28,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:28,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:30:28,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:30:28,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:28" (1/1) ... [2019-10-06 23:30:28,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128bbf62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:28, skipping insertion in model container [2019-10-06 23:30:28,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:30:28" (1/1) ... [2019-10-06 23:30:28,901 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:30:28,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:30:29,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:29,125 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:30:29,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:30:29,171 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:30:29,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:29 WrapperNode [2019-10-06 23:30:29,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:30:29,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:30:29,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:30:29,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:30:29,275 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:29" (1/1) ... [2019-10-06 23:30:29,275 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:29" (1/1) ... [2019-10-06 23:30:29,283 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:29" (1/1) ... [2019-10-06 23:30:29,284 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:29" (1/1) ... [2019-10-06 23:30:29,302 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:29" (1/1) ... [2019-10-06 23:30:29,308 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:29" (1/1) ... [2019-10-06 23:30:29,309 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:29" (1/1) ... [2019-10-06 23:30:29,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:30:29,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:30:29,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:30:29,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:30:29,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:29" (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:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:30:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:30:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:30:29,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:30:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:30:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:30:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:30:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:30:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:30:29,755 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:30:29,755 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-06 23:30:29,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:29 BoogieIcfgContainer [2019-10-06 23:30:29,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:30:29,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:30:29,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:30:29,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:30:29,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:30:28" (1/3) ... [2019-10-06 23:30:29,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b82bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:29, skipping insertion in model container [2019-10-06 23:30:29,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:30:29" (2/3) ... [2019-10-06 23:30:29,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b82bea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:30:29, skipping insertion in model container [2019-10-06 23:30:29,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:30:29" (3/3) ... [2019-10-06 23:30:29,763 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy2_ground-1.i [2019-10-06 23:30:29,771 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:30:29,779 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:30:29,790 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:30:29,813 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:30:29,813 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:30:29,813 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:30:29,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:30:29,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:30:29,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:30:29,814 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:30:29,814 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:30:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-06 23:30:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:30:29,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:29,834 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:29,835 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:29,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1240250468, now seen corresponding path program 1 times [2019-10-06 23:30:29,849 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:29,849 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:29,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:29,850 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:29,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,018 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:30,019 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,020 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:30,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:30,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:30,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:30,041 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2019-10-06 23:30:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:30,075 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-10-06 23:30:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:30,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:30:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:30,084 INFO L225 Difference]: With dead ends: 35 [2019-10-06 23:30:30,084 INFO L226 Difference]: Without dead ends: 18 [2019-10-06 23:30:30,087 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:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-06 23:30:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-06 23:30:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-06 23:30:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-10-06 23:30:30,135 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2019-10-06 23:30:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:30,136 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-10-06 23:30:30,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-10-06 23:30:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:30:30,137 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:30,137 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:30,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash 650913249, now seen corresponding path program 1 times [2019-10-06 23:30:30,139 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:30,139 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,139 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,139 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,193 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:30,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:30:30,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:30:30,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:30:30,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:30:30,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:30:30,198 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 3 states. [2019-10-06 23:30:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:30,225 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-06 23:30:30,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:30:30,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:30:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:30,228 INFO L225 Difference]: With dead ends: 30 [2019-10-06 23:30:30,229 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:30:30,230 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:30,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:30:30,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:30:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:30:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-10-06 23:30:30,239 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2019-10-06 23:30:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:30,239 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-10-06 23:30:30,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:30:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-10-06 23:30:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:30:30,240 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:30,240 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:30,240 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:30,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash -586370056, now seen corresponding path program 1 times [2019-10-06 23:30:30,241 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:30,241 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,242 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,242 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:30,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:30:30,356 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:30,357 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:30,357 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:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:30,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:30:30,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:30:30,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:30:30,489 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:30,515 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:30,515 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:30,521 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:30,529 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:30,530 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:30,700 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:31,461 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:30:31,555 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:31,568 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:31,574 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:31,574 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:31,574 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:31,575 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,575 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,575 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,575 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:31,576 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:31,576 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,576 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:31,576 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:31,577 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:31,577 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:31,577 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:31,577 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:31,578 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_4 Int) (|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a3~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_4) v_prenex_3) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (and (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_1|) |v_main_~#a3~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_1|) |v_main_~#a1~0.offset_BEFORE_CALL_1|))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:30:31,876 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:31,877 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-06 23:30:31,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-06 23:30:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-06 23:30:31,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-10-06 23:30:31,880 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 17 states. [2019-10-06 23:30:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:32,485 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2019-10-06 23:30:32,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:30:32,485 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-10-06 23:30:32,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:32,487 INFO L225 Difference]: With dead ends: 47 [2019-10-06 23:30:32,487 INFO L226 Difference]: Without dead ends: 34 [2019-10-06 23:30:32,488 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2019-10-06 23:30:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-06 23:30:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-10-06 23:30:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-06 23:30:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-06 23:30:32,495 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-10-06 23:30:32,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:32,495 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-06 23:30:32,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-06 23:30:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-06 23:30:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:30:32,496 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:32,497 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:32,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:32,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:32,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1834779132, now seen corresponding path program 2 times [2019-10-06 23:30:32,702 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:32,702 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:32,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:32,703 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:32,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:30:32,774 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:32,775 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:32,775 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:32,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:30:32,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:32,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:30:32,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-06 23:30:32,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-06 23:30:32,909 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:32,910 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:32,910 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:32,911 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:32,911 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:32,913 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:32,942 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:33,545 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:33,560 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:33,566 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:33,567 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:33,567 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:33,567 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:33,568 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:33,568 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:33,569 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:33,572 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:33,573 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:33,573 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:33,573 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:33,573 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:33,573 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:33,574 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:33,574 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int) (|v_main_~#a3~0.base_BEFORE_CALL_2| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_8) v_prenex_7)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_2|) |v_main_~#a3~0.offset_BEFORE_CALL_2|))))) [2019-10-06 23:30:33,937 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:33,938 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:30:33,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:30:33,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:30:33,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:30:33,940 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 23 states. [2019-10-06 23:30:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:34,759 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2019-10-06 23:30:34,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:30:34,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-10-06 23:30:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:34,761 INFO L225 Difference]: With dead ends: 58 [2019-10-06 23:30:34,762 INFO L226 Difference]: Without dead ends: 43 [2019-10-06 23:30:34,763 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1403, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:30:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-06 23:30:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2019-10-06 23:30:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-06 23:30:34,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-10-06 23:30:34,771 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2019-10-06 23:30:34,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:34,772 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-10-06 23:30:34,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:30:34,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-10-06 23:30:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-06 23:30:34,773 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:34,773 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:34,980 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:34,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash -191297983, now seen corresponding path program 3 times [2019-10-06 23:30:34,981 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:34,982 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:34,982 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:34,982 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:35,118 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:35,118 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:35,119 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:35,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:35,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:35,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:30:35,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:35,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:35,461 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:35,463 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:35,463 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:35,464 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:35,464 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:35,464 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:35,487 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:35,772 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:30:36,103 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:36,111 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:36,114 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:36,114 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:36,115 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:36,115 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:36,115 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:36,115 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:36,116 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:36,116 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:36,116 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:36,116 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:36,116 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:36,117 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:36,117 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:36,117 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:36,117 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:36,118 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a3~0.base_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_11) v_prenex_10) (select (select |#memory_int| v_prenex_9) v_prenex_12))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_3|) |v_main_~#a3~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_3|) |v_main_~#a1~0.offset_BEFORE_CALL_3|)))))) [2019-10-06 23:30:36,398 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:36,398 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 11] total 25 [2019-10-06 23:30:36,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:30:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:30:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:30:36,400 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 25 states. [2019-10-06 23:30:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:37,155 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2019-10-06 23:30:37,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-06 23:30:37,155 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-10-06 23:30:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:37,156 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:30:37,156 INFO L226 Difference]: Without dead ends: 50 [2019-10-06 23:30:37,158 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2019-10-06 23:30:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-06 23:30:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2019-10-06 23:30:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-06 23:30:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-10-06 23:30:37,167 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 30 [2019-10-06 23:30:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:37,168 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-10-06 23:30:37,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:30:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-10-06 23:30:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-06 23:30:37,169 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:37,169 INFO L385 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:37,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:37,382 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:37,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:37,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1575190852, now seen corresponding path program 4 times [2019-10-06 23:30:37,384 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:37,384 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:37,384 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:37,385 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:37,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:37,588 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:37,588 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:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:37,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:30:37,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:37,695 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:37,973 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:37,974 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:37,975 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:37,975 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:37,975 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:37,975 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:38,004 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:38,461 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:38,468 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:38,472 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:38,472 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:38,472 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:38,473 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:38,473 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:38,473 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:38,473 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:38,473 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:38,474 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:38,474 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:38,474 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:38,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:38,474 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:38,475 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:38,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:38,475 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_16 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a3~0.base_BEFORE_CALL_4| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_4|) |v_main_~#a3~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_13) v_prenex_16)))))) [2019-10-06 23:30:38,781 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:38,782 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:30:38,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:30:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:30:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:30:38,786 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 39 states. [2019-10-06 23:30:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:40,116 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2019-10-06 23:30:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:30:40,116 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 37 [2019-10-06 23:30:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:40,118 INFO L225 Difference]: With dead ends: 87 [2019-10-06 23:30:40,118 INFO L226 Difference]: Without dead ends: 64 [2019-10-06 23:30:40,121 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1244, Invalid=3868, Unknown=0, NotChecked=0, Total=5112 [2019-10-06 23:30:40,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-06 23:30:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2019-10-06 23:30:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-06 23:30:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-10-06 23:30:40,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 37 [2019-10-06 23:30:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:40,131 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-10-06 23:30:40,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:30:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-10-06 23:30:40,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-06 23:30:40,133 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:40,133 INFO L385 BasicCegarLoop]: trace histogram [26, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:40,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:40,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 250980004, now seen corresponding path program 5 times [2019-10-06 23:30:40,338 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:40,339 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,339 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,339 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-06 23:30:40,799 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:40,800 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:40,800 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:41,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-06 23:30:41,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:41,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-06 23:30:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-10-06 23:30:41,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-10-06 23:30:41,354 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:41,355 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:41,355 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:41,355 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:41,356 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:41,356 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:41,376 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:41,829 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:41,835 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:41,838 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:41,838 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:41,838 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:41,838 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:41,839 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:41,839 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:41,839 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:41,839 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:41,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:41,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:41,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:41,840 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:41,840 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:41,840 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:41,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:41,841 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a3~0.base_BEFORE_CALL_5| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_5| Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#a1~0.base_BEFORE_CALL_5| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_5|) |v_main_~#a3~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))))) [2019-10-06 23:30:42,380 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:42,380 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 9, 9, 11] total 53 [2019-10-06 23:30:42,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-06 23:30:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-06 23:30:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=2202, Unknown=0, NotChecked=0, Total=2756 [2019-10-06 23:30:42,384 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 53 states. [2019-10-06 23:30:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:45,046 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2019-10-06 23:30:45,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-06 23:30:45,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 51 [2019-10-06 23:30:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:45,048 INFO L225 Difference]: With dead ends: 104 [2019-10-06 23:30:45,048 INFO L226 Difference]: Without dead ends: 81 [2019-10-06 23:30:45,052 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1684, Invalid=8416, Unknown=0, NotChecked=0, Total=10100 [2019-10-06 23:30:45,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-06 23:30:45,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-06 23:30:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-06 23:30:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-10-06 23:30:45,063 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 51 [2019-10-06 23:30:45,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:45,063 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-10-06 23:30:45,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-06 23:30:45,064 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-10-06 23:30:45,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:30:45,066 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:45,066 INFO L385 BasicCegarLoop]: trace histogram [27, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:45,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:45,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash -135987743, now seen corresponding path program 6 times [2019-10-06 23:30:45,270 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:45,270 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:45,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:45,271 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:45,721 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:45,721 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:45,721 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:45,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:30:45,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:30:45,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:30:45,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:45,906 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:46,779 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:46,780 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:46,780 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:46,780 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:46,781 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:46,781 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:46,800 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:47,237 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:47,242 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:47,245 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:47,245 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:47,245 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:47,246 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:47,246 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:47,246 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:47,246 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:47,246 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:47,247 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:47,247 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:47,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:47,247 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:47,247 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:47,247 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:47,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:47,248 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#a3~0.base_BEFORE_CALL_6| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_6| Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_6|) |v_main_~#a3~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:30:47,618 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:47,618 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 69 [2019-10-06 23:30:47,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-06 23:30:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-06 23:30:47,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1740, Invalid=2952, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:30:47,621 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 69 states. [2019-10-06 23:30:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:30:50,846 INFO L93 Difference]: Finished difference Result 149 states and 183 transitions. [2019-10-06 23:30:50,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:30:50,849 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-10-06 23:30:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:30:50,850 INFO L225 Difference]: With dead ends: 149 [2019-10-06 23:30:50,850 INFO L226 Difference]: Without dead ends: 110 [2019-10-06 23:30:50,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3749 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5099, Invalid=12193, Unknown=0, NotChecked=0, Total=17292 [2019-10-06 23:30:50,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-06 23:30:50,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2019-10-06 23:30:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-06 23:30:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2019-10-06 23:30:50,868 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 68 [2019-10-06 23:30:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:30:50,869 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2019-10-06 23:30:50,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-06 23:30:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2019-10-06 23:30:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-06 23:30:50,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:30:50,871 INFO L385 BasicCegarLoop]: trace histogram [56, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:30:51,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:30:51,083 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:30:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:30:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 604097156, now seen corresponding path program 7 times [2019-10-06 23:30:51,084 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:30:51,084 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:51,084 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:51,084 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:30:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:30:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:52,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:30:52,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:30:52,492 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:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:30:52,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:30:52,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:30:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:52,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:30:56,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:30:56,239 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:30:56,240 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:30:56,241 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:30:56,241 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:30:56,241 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:30:56,241 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:30:56,271 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:30:56,757 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:30:56,765 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:30:56,768 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:30:56,768 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:30:56,768 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:56,768 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:56,768 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:56,769 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:56,769 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:30:56,769 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:30:56,769 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:56,769 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:56,770 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:30:56,770 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:30:56,770 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:30:56,770 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:30:56,770 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:30:56,770 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (|v_main_~#a3~0.base_BEFORE_CALL_7| Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_7|) |v_main_~#a3~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))))) [2019-10-06 23:30:57,299 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:30:57,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:30:57,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:30:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:30:57,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:30:57,306 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 127 states. [2019-10-06 23:31:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:06,828 INFO L93 Difference]: Finished difference Result 207 states and 270 transitions. [2019-10-06 23:31:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:31:06,828 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 97 [2019-10-06 23:31:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:06,830 INFO L225 Difference]: With dead ends: 207 [2019-10-06 23:31:06,830 INFO L226 Difference]: Without dead ends: 168 [2019-10-06 23:31:06,835 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:31:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-06 23:31:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2019-10-06 23:31:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-10-06 23:31:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 162 transitions. [2019-10-06 23:31:06,854 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 162 transitions. Word has length 97 [2019-10-06 23:31:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:06,855 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 162 transitions. [2019-10-06 23:31:06,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:31:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 162 transitions. [2019-10-06 23:31:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-06 23:31:06,858 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:06,858 INFO L385 BasicCegarLoop]: trace histogram [114, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:07,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:07,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:07,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:07,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1478553508, now seen corresponding path program 8 times [2019-10-06 23:31:07,063 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:07,064 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:07,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:07,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-10-06 23:31:12,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:12,411 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:12,411 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:31:35,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-06 23:31:35,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:35,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-06 23:31:35,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 14 proven. 105 refuted. 0 times theorem prover too weak. 6646 trivial. 0 not checked. [2019-10-06 23:31:36,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:31:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6765 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 6660 trivial. 0 not checked. [2019-10-06 23:31:37,633 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:31:37,634 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:31:37,634 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:31:37,635 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:31:37,635 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:31:37,635 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:31:37,654 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:31:38,099 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:31:38,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:31:38,111 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:31:38,111 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:31:38,111 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,111 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:38,112 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:38,112 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:38,112 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:31:38,112 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:31:38,112 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:38,112 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:31:38,112 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:31:38,113 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:31:38,113 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:31:38,113 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:31:38,113 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:31:38,113 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_29 Int) (|v_main_~#a3~0.base_BEFORE_CALL_8| Int) (v_prenex_30 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_8| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_8| Int) (v_prenex_32 Int) (v_prenex_31 Int) (|v_main_~#a1~0.base_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_32) v_prenex_31) (select (select |#memory_int| v_prenex_29) v_prenex_30)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_8|) |v_main_~#a1~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_8|) |v_main_~#a3~0.offset_BEFORE_CALL_8|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:31:38,962 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:31:38,962 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 18, 17, 11] total 158 [2019-10-06 23:31:38,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-10-06 23:31:38,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-10-06 23:31:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7342, Invalid=17464, Unknown=0, NotChecked=0, Total=24806 [2019-10-06 23:31:38,967 INFO L87 Difference]: Start difference. First operand 159 states and 162 transitions. Second operand 158 states. [2019-10-06 23:31:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:31:53,525 INFO L93 Difference]: Finished difference Result 240 states and 278 transitions. [2019-10-06 23:31:53,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2019-10-06 23:31:53,526 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 155 [2019-10-06 23:31:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:31:53,528 INFO L225 Difference]: With dead ends: 240 [2019-10-06 23:31:53,528 INFO L226 Difference]: Without dead ends: 201 [2019-10-06 23:31:53,530 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21016 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=22049, Invalid=73741, Unknown=0, NotChecked=0, Total=95790 [2019-10-06 23:31:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-10-06 23:31:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2019-10-06 23:31:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-06 23:31:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 195 transitions. [2019-10-06 23:31:53,551 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 195 transitions. Word has length 155 [2019-10-06 23:31:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:31:53,551 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 195 transitions. [2019-10-06 23:31:53,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-10-06 23:31:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 195 transitions. [2019-10-06 23:31:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-06 23:31:53,554 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:31:53,555 INFO L385 BasicCegarLoop]: trace histogram [115, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:31:53,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:31:53,761 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:31:53,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:31:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1836774047, now seen corresponding path program 9 times [2019-10-06 23:31:53,762 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:31:53,762 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:53,762 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:53,763 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:31:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:31:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:31:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7600 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:31:58,991 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:31:58,991 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:31:58,992 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:59,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:31:59,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:31:59,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 117 conjunts are in the unsatisfiable core [2019-10-06 23:31:59,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:31:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7600 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:31:59,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:32:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7600 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:32:14,010 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:32:14,011 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:32:14,012 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:32:14,012 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:32:14,012 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:32:14,012 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:32:14,029 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:32:14,474 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:32:14,485 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:32:14,520 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:32:14,520 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:32:14,521 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:14,521 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:32:14,521 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:32:14,522 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:32:14,522 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:32:14,522 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:32:14,522 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:32:14,522 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_34 Int) (v_prenex_33 Int) (v_prenex_36 Int) (v_prenex_35 Int) (|v_main_~#a3~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.base_BEFORE_CALL_9| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_9| Int) (|v_main_~#a3~0.offset_BEFORE_CALL_9| Int)) (or (and (not (= (select (select |#memory_int| v_prenex_33) v_prenex_36) (select (select |#memory_int| v_prenex_34) v_prenex_35))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_9|) |v_main_~#a3~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_9|) |v_main_~#a1~0.offset_BEFORE_CALL_9|))))) [2019-10-06 23:32:15,424 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:32:15,424 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [118, 118, 118, 11] total 245 [2019-10-06 23:32:15,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 245 states [2019-10-06 23:32:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 245 interpolants. [2019-10-06 23:32:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27524, Invalid=32256, Unknown=0, NotChecked=0, Total=59780 [2019-10-06 23:32:15,430 INFO L87 Difference]: Start difference. First operand 192 states and 195 transitions. Second operand 245 states. [2019-10-06 23:32:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:32:50,336 INFO L93 Difference]: Finished difference Result 389 states and 511 transitions. [2019-10-06 23:32:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2019-10-06 23:32:50,337 INFO L78 Accepts]: Start accepts. Automaton has 245 states. Word has length 188 [2019-10-06 23:32:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:32:50,340 INFO L225 Difference]: With dead ends: 389 [2019-10-06 23:32:50,340 INFO L226 Difference]: Without dead ends: 318 [2019-10-06 23:32:50,345 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40929 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=82099, Invalid=151673, Unknown=0, NotChecked=0, Total=233772 [2019-10-06 23:32:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-06 23:32:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 309. [2019-10-06 23:32:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-06 23:32:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2019-10-06 23:32:50,372 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 188 [2019-10-06 23:32:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:32:50,372 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2019-10-06 23:32:50,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 245 states. [2019-10-06 23:32:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2019-10-06 23:32:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-06 23:32:50,378 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:32:50,378 INFO L385 BasicCegarLoop]: trace histogram [232, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:32:50,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:32:50,583 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:32:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:32:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 81894532, now seen corresponding path program 10 times [2019-10-06 23:32:50,584 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:32:50,584 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:32:50,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:50,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:32:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:32:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27958 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:33:11,064 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:33:11,064 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:33:11,065 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:33:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:33:11,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 2167 conjuncts, 234 conjunts are in the unsatisfiable core [2019-10-06 23:33:11,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:33:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 27958 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:33:11,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:34:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 27958 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:34:12,072 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:34:12,074 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-06 23:34:12,074 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:34:12,074 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:34:12,075 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:34:12,075 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:34:12,114 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:34:12,592 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:34:12,599 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:34:12,601 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:34:12,602 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 178#(and (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 168#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a3~0.base|) (+ (* 4 main_~x~0) |main_~#a3~0.offset|))) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (= (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|)) |main_#t~mem8|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 183#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 192#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:34:12,602 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:34:12,602 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:34:12,603 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:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 197#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 72#true [2019-10-06 23:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 188#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 163#(and (<= 100000 main_~a~0) (<= 0 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:34:12,603 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 173#(exists ((v_prenex_38 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_10| Int) (v_prenex_37 Int) (v_prenex_39 Int) (|v_main_~#a3~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a1~0.base_BEFORE_CALL_10| Int) (|v_main_~#a3~0.base_BEFORE_CALL_10| Int) (v_prenex_40 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a3~0.base_BEFORE_CALL_10|) |v_main_~#a3~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_10|) |v_main_~#a1~0.offset_BEFORE_CALL_10|)))) (and (= (select (select |#memory_int| v_prenex_40) v_prenex_38) (select (select |#memory_int| v_prenex_39) v_prenex_37)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:34:14,124 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:34:14,124 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [235, 235, 235, 11] total 479 [2019-10-06 23:34:14,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 479 states [2019-10-06 23:34:14,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 479 interpolants. [2019-10-06 23:34:14,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109775, Invalid=119187, Unknown=0, NotChecked=0, Total=228962 [2019-10-06 23:34:14,140 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 479 states. [2019-10-06 23:36:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:36:28,012 INFO L93 Difference]: Finished difference Result 623 states and 862 transitions. [2019-10-06 23:36:28,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 478 states. [2019-10-06 23:36:28,012 INFO L78 Accepts]: Start accepts. Automaton has 479 states. Word has length 305 [2019-10-06 23:36:28,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:36:28,016 INFO L225 Difference]: With dead ends: 623 [2019-10-06 23:36:28,016 INFO L226 Difference]: Without dead ends: 552 [2019-10-06 23:36:28,032 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1623 GetRequests, 673 SyntacticMatches, 0 SemanticMatches, 950 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150324 ImplicationChecksByTransitivity, 203.7s TimeCoverageRelationStatistics Valid=328384, Invalid=576968, Unknown=0, NotChecked=0, Total=905352 [2019-10-06 23:36:28,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-06 23:36:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 543. [2019-10-06 23:36:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-06 23:36:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 546 transitions. [2019-10-06 23:36:28,058 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 546 transitions. Word has length 305 [2019-10-06 23:36:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:36:28,059 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 546 transitions. [2019-10-06 23:36:28,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 479 states. [2019-10-06 23:36:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 546 transitions. [2019-10-06 23:36:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2019-10-06 23:36:28,071 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:36:28,071 INFO L385 BasicCegarLoop]: trace histogram [466, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:36:28,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:36:28,279 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:36:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:36:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1390116700, now seen corresponding path program 11 times [2019-10-06 23:36:28,279 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:36:28,280 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:36:28,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:28,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:36:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:36:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:37:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 109741 backedges. 0 proven. 108811 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2019-10-06 23:37:49,451 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:37:49,452 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:37:49,452 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