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_copy8_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:43:16,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:43:16,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:43:16,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:43:16,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:43:16,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:43:16,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:43:16,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:43:16,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:43:16,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:43:16,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:43:16,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:43:16,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:43:16,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:43:16,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:43:16,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:43:16,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:43:16,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:43:16,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:43:16,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:43:16,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:43:16,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:43:16,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:43:16,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:43:16,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:43:16,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:43:16,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:43:16,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:43:16,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:43:16,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:43:16,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:43:16,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:43:16,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:43:16,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:43:16,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:43:16,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:43:16,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:43:16,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:43:16,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:43:16,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:43:16,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:43:16,694 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:43:16,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:43:16,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:43:16,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:43:16,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:43:16,731 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:43:16,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:43:16,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:43:16,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:43:16,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:43:16,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:43:16,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:43:16,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:43:16,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:43:16,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:43:16,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:43:16,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:43:16,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:43:16,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:43:16,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:43:16,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:43:16,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:43:16,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:43:16,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:43:16,739 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:43:17,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:43:17,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:43:17,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:43:17,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:43:17,027 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:43:17,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-06 23:43:17,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbe1c3f9/9f1be178257a4a35984375aa7373469e/FLAG465374e42 [2019-10-06 23:43:17,579 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:43:17,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-2.i [2019-10-06 23:43:17,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbe1c3f9/9f1be178257a4a35984375aa7373469e/FLAG465374e42 [2019-10-06 23:43:17,972 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbe1c3f9/9f1be178257a4a35984375aa7373469e [2019-10-06 23:43:17,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:43:17,984 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:43:17,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:17,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:43:17,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:43:17,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:17" (1/1) ... [2019-10-06 23:43:17,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef99201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:17, skipping insertion in model container [2019-10-06 23:43:17,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:43:17" (1/1) ... [2019-10-06 23:43:18,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:43:18,020 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:43:18,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:18,235 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:43:18,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:43:18,372 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:43:18,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18 WrapperNode [2019-10-06 23:43:18,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:43:18,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:43:18,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:43:18,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:43:18,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (1/1) ... [2019-10-06 23:43:18,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:43:18,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:43:18,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:43:18,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:43:18,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (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:43:18,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:43:18,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:43:18,492 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:43:18,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:43:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:43:18,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:43:18,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:43:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:43:18,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:43:19,106 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:43:19,106 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-06 23:43:19,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:19 BoogieIcfgContainer [2019-10-06 23:43:19,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:43:19,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:43:19,110 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:43:19,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:43:19,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:43:17" (1/3) ... [2019-10-06 23:43:19,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:19, skipping insertion in model container [2019-10-06 23:43:19,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:43:18" (2/3) ... [2019-10-06 23:43:19,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789782f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:43:19, skipping insertion in model container [2019-10-06 23:43:19,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:43:19" (3/3) ... [2019-10-06 23:43:19,117 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-2.i [2019-10-06 23:43:19,128 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:43:19,137 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:43:19,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:43:19,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:43:19,175 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:43:19,175 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:43:19,175 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:43:19,175 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:43:19,176 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:43:19,176 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:43:19,176 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:43:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2019-10-06 23:43:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-06 23:43:19,197 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:19,198 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:19,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1040189996, now seen corresponding path program 1 times [2019-10-06 23:43:19,214 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:19,214 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,215 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:19,409 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:43:19,410 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,410 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:19,411 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:19,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:19,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:19,437 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2019-10-06 23:43:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:19,478 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-10-06 23:43:19,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:19,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-06 23:43:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:19,492 INFO L225 Difference]: With dead ends: 47 [2019-10-06 23:43:19,492 INFO L226 Difference]: Without dead ends: 24 [2019-10-06 23:43:19,497 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:43:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-06 23:43:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-06 23:43:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-06 23:43:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-10-06 23:43:19,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 19 [2019-10-06 23:43:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:19,549 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-10-06 23:43:19,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2019-10-06 23:43:19,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-06 23:43:19,551 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:19,551 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:19,551 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:19,552 INFO L82 PathProgramCache]: Analyzing trace with hash -537190458, now seen corresponding path program 1 times [2019-10-06 23:43:19,552 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:19,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:19,625 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:43:19,630 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,630 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:43:19,630 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:43:19,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:43:19,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:43:19,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:43:19,634 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2019-10-06 23:43:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:19,718 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2019-10-06 23:43:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:43:19,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-06 23:43:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:19,722 INFO L225 Difference]: With dead ends: 48 [2019-10-06 23:43:19,722 INFO L226 Difference]: Without dead ends: 32 [2019-10-06 23:43:19,723 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:43:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-06 23:43:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-10-06 23:43:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-06 23:43:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2019-10-06 23:43:19,738 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 20 [2019-10-06 23:43:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:19,739 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2019-10-06 23:43:19,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:43:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2019-10-06 23:43:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-06 23:43:19,741 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:19,742 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:19,742 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash -669181734, now seen corresponding path program 1 times [2019-10-06 23:43:19,743 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:19,744 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:19,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:19,952 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:19,952 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:43:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:20,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:43:20,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:20,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-06 23:43:20,160 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:20,204 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:20,205 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:20,216 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:20,224 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:20,225 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:20,351 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:22,909 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:23,202 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:24,845 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:24,861 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:24,868 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:24,869 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:24,869 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 438#(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_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~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| __VERIFIER_assert_~cond)) [2019-10-06 23:43:24,870 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 443#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~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_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~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|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:24,870 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 74#true [2019-10-06 23:43:24,871 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 452#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:24,871 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 203#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,871 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 375#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,872 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 428#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:43:24,872 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 246#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,872 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:43:24,872 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:43:24,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 457#(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:43:24,877 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 418#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,878 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 117#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,878 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:24,878 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 289#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,878 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 433#(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_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~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|))))) [2019-10-06 23:43:24,879 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 160#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:24,879 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 448#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~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_main_~#a9~0.base_BEFORE_CALL_1| Int) (v_prenex_3 Int) (|v_main_~#a9~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int)) (or (and (not (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_1) v_prenex_2))) (= |__VERIFIER_assert_#in~cond| 0)) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_1|) |v_main_~#a9~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|))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:24,879 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 423#(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:43:24,879 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 332#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:25,190 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:25,190 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:43:25,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:43:25,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:43:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:43:25,193 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 18 states. [2019-10-06 23:43:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:26,085 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2019-10-06 23:43:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-06 23:43:26,086 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-10-06 23:43:26,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:26,087 INFO L225 Difference]: With dead ends: 77 [2019-10-06 23:43:26,088 INFO L226 Difference]: Without dead ends: 52 [2019-10-06 23:43:26,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:43:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-06 23:43:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-10-06 23:43:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-06 23:43:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-06 23:43:26,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 28 [2019-10-06 23:43:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:26,100 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-06 23:43:26,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:43:26,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-06 23:43:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:43:26,102 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:26,102 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:26,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:26,316 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:26,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:26,317 INFO L82 PathProgramCache]: Analyzing trace with hash 619647852, now seen corresponding path program 2 times [2019-10-06 23:43:26,318 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:26,318 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:26,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:26,319 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:26,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-06 23:43:26,408 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:26,408 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:26,408 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:43:26,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:43:26,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:26,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:43:26,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-06 23:43:26,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-06 23:43:26,618 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:26,621 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:26,621 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:26,621 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:26,622 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:26,622 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:26,647 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:27,016 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:28,556 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:28,565 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:28,569 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:28,569 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,570 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,571 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:43:28,571 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,571 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:43:28,571 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:43:28,571 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(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_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) [2019-10-06 23:43:28,572 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,573 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (|v_main_~#a9~0.base_BEFORE_CALL_2| Int) (|v_main_~#a9~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_7) v_prenex_8))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_2|) |v_main_~#a1~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_2|) |v_main_~#a9~0.offset_BEFORE_CALL_2|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:28,573 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:43:28,573 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:28,903 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:28,903 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 11] total 23 [2019-10-06 23:43:28,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:43:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:43:28,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:43:28,906 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 23 states. [2019-10-06 23:43:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:30,113 INFO L93 Difference]: Finished difference Result 118 states and 168 transitions. [2019-10-06 23:43:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-06 23:43:30,114 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-10-06 23:43:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:30,116 INFO L225 Difference]: With dead ends: 118 [2019-10-06 23:43:30,116 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:43:30,118 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 103 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:43:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:43:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-10-06 23:43:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-06 23:43:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-10-06 23:43:30,132 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 39 [2019-10-06 23:43:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:30,133 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-10-06 23:43:30,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:43:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-10-06 23:43:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-06 23:43:30,135 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:30,135 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:30,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:30,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1999730054, now seen corresponding path program 3 times [2019-10-06 23:43:30,341 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:30,341 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:30,341 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:30,341 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-06 23:43:30,655 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:30,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:30,656 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:43:30,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:43:30,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:30,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-06 23:43:30,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-06 23:43:30,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-06 23:43:30,953 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:30,955 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:30,955 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:30,956 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:30,956 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:30,956 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:30,983 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:31,496 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:31,780 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:32,037 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:32,284 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:43:32,909 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:32,920 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:32,923 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:32,923 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:32,924 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~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:43:32,924 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~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_#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:43:32,924 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:43:32,924 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:32,924 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,925 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,925 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:43:32,925 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,927 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:43:32,927 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:43:32,927 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:43:32,927 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,927 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,927 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:32,928 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,928 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~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:43:32,928 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:32,928 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#a9~0.base_BEFORE_CALL_3| Int) (|v_main_~#a9~0.offset_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| 0) (not (= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_9) v_prenex_12)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_3|) |v_main_~#a9~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_#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:43:32,928 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:43:32,929 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:33,338 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:33,339 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 11] total 31 [2019-10-06 23:43:33,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-06 23:43:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-06 23:43:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:43:33,341 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 31 states. [2019-10-06 23:43:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:34,733 INFO L93 Difference]: Finished difference Result 165 states and 197 transitions. [2019-10-06 23:43:34,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-06 23:43:34,733 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2019-10-06 23:43:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:34,735 INFO L225 Difference]: With dead ends: 165 [2019-10-06 23:43:34,735 INFO L226 Difference]: Without dead ends: 100 [2019-10-06 23:43:34,737 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:43:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-06 23:43:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2019-10-06 23:43:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-06 23:43:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-10-06 23:43:34,752 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 72 [2019-10-06 23:43:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:34,752 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-10-06 23:43:34,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-06 23:43:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-10-06 23:43:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-06 23:43:34,754 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:34,754 INFO L385 BasicCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:34,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:34,959 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2107999872, now seen corresponding path program 4 times [2019-10-06 23:43:34,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:34,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:34,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:34,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-06 23:43:35,192 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:35,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:35,193 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:43:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:35,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-06 23:43:35,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-06 23:43:35,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-06 23:43:35,600 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:35,602 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:35,602 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:35,602 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:35,603 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:35,603 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:35,620 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:36,459 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:43:37,294 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:37,300 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:37,304 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:37,304 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:37,304 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:37,305 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:43:37,305 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:43:37,305 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:37,305 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,305 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,306 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:43:37,306 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,306 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:43:37,306 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:43:37,306 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:43:37,306 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,307 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,310 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:37,310 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,311 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:43:37,311 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,311 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a9~0.base_BEFORE_CALL_4| Int) (|v_main_~#a9~0.offset_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_prenex_13) v_prenex_16) (select (select |#memory_int| v_prenex_14) v_prenex_15))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_4|) |v_main_~#a9~0.offset_BEFORE_CALL_4|)))))) (<= 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:43:37,311 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:43:37,312 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:37,629 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:37,630 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 11] total 39 [2019-10-06 23:43:37,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-06 23:43:37,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-06 23:43:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2019-10-06 23:43:37,633 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 39 states. [2019-10-06 23:43:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:43:39,077 INFO L93 Difference]: Finished difference Result 187 states and 218 transitions. [2019-10-06 23:43:39,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-06 23:43:39,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 87 [2019-10-06 23:43:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:43:39,079 INFO L225 Difference]: With dead ends: 187 [2019-10-06 23:43:39,080 INFO L226 Difference]: Without dead ends: 114 [2019-10-06 23:43:39,082 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 239 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:43:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-06 23:43:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2019-10-06 23:43:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-06 23:43:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-10-06 23:43:39,096 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 87 [2019-10-06 23:43:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:43:39,097 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-10-06 23:43:39,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-06 23:43:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-10-06 23:43:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-06 23:43:39,098 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:43:39,099 INFO L385 BasicCegarLoop]: trace histogram [26, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:43:39,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:43:39,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:43:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:43:39,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1234309056, now seen corresponding path program 5 times [2019-10-06 23:43:39,301 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:43:39,301 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:39,301 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:39,302 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:43:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:43:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:43:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2019-10-06 23:43:39,805 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:43:39,805 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:43:39,805 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:43:56,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:43:56,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:43:56,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-06 23:43:56,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:43:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-10-06 23:43:56,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:43:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-10-06 23:43:56,971 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:43:56,972 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:43:56,973 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:43:56,973 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:43:56,974 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:43:56,974 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:43:57,000 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:43:58,670 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:43:58,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:43:58,680 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:43:58,681 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:43:58,681 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:58,681 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(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_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:58,681 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:43:58,682 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:43:58,682 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,682 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,682 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:43:58,682 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,683 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:43:58,683 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:43:58,683 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,683 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:43:58,683 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,683 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:43:58,684 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:43:58,684 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:58,684 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(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_~#a9~0.base_BEFORE_CALL_5| Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| v_prenex_19) v_prenex_20) (select (select |#memory_int| v_prenex_17) v_prenex_18))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_5|) |v_main_~#a9~0.offset_BEFORE_CALL_5|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:43:58,685 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:43:58,685 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:43:59,193 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:43:59,193 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 10, 10, 11] total 55 [2019-10-06 23:43:59,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-06 23:43:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-06 23:43:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=2383, Unknown=0, NotChecked=0, Total=2970 [2019-10-06 23:43:59,197 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 55 states. [2019-10-06 23:44:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:02,435 INFO L93 Difference]: Finished difference Result 260 states and 350 transitions. [2019-10-06 23:44:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-06 23:44:02,436 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 101 [2019-10-06 23:44:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:02,438 INFO L225 Difference]: With dead ends: 260 [2019-10-06 23:44:02,439 INFO L226 Difference]: Without dead ends: 187 [2019-10-06 23:44:02,443 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2559 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1787, Invalid=9133, Unknown=0, NotChecked=0, Total=10920 [2019-10-06 23:44:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-06 23:44:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2019-10-06 23:44:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-06 23:44:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 187 transitions. [2019-10-06 23:44:02,466 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 187 transitions. Word has length 101 [2019-10-06 23:44:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:02,467 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 187 transitions. [2019-10-06 23:44:02,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-06 23:44:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 187 transitions. [2019-10-06 23:44:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-06 23:44:02,470 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:02,470 INFO L385 BasicCegarLoop]: trace histogram [27, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:02,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:02,671 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash 38478726, now seen corresponding path program 6 times [2019-10-06 23:44:02,672 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:02,672 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:02,672 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:02,672 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-10-06 23:44:03,701 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:03,701 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:03,702 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:44:03,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:44:03,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:44:03,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-06 23:44:03,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2019-10-06 23:44:04,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2019-10-06 23:44:05,674 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:05,676 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:44:05,676 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:05,677 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:05,677 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:05,677 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:05,698 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:07,391 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:07,396 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:07,399 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:07,400 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,400 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,401 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:44:07,401 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:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,401 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) [2019-10-06 23:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a9~0.base_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a9~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| 1) (= (select (select |#memory_int| |v_main_~#a9~0.base_BEFORE_CALL_6|) |v_main_~#a9~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_21) v_prenex_22) (select (select |#memory_int| v_prenex_23) v_prenex_24)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:44:07,402 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:07,917 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:07,918 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30, 30, 11] total 85 [2019-10-06 23:44:07,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-06 23:44:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-06 23:44:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5288, Unknown=0, NotChecked=0, Total=7140 [2019-10-06 23:44:07,922 INFO L87 Difference]: Start difference. First operand 178 states and 187 transitions. Second operand 85 states. [2019-10-06 23:44:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:13,291 INFO L93 Difference]: Finished difference Result 369 states and 423 transitions. [2019-10-06 23:44:13,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-06 23:44:13,292 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2019-10-06 23:44:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:13,294 INFO L225 Difference]: With dead ends: 369 [2019-10-06 23:44:13,294 INFO L226 Difference]: Without dead ends: 224 [2019-10-06 23:44:13,301 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6333 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5584, Invalid=21476, Unknown=0, NotChecked=0, Total=27060 [2019-10-06 23:44:13,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-06 23:44:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 215. [2019-10-06 23:44:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-06 23:44:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 224 transitions. [2019-10-06 23:44:13,325 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 224 transitions. Word has length 174 [2019-10-06 23:44:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:13,326 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 224 transitions. [2019-10-06 23:44:13,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-06 23:44:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 224 transitions. [2019-10-06 23:44:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-06 23:44:13,329 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:13,329 INFO L385 BasicCegarLoop]: trace histogram [56, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:13,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:13,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:13,541 INFO L82 PathProgramCache]: Analyzing trace with hash -97682880, now seen corresponding path program 7 times [2019-10-06 23:44:13,541 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:13,541 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:13,542 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:13,542 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-10-06 23:44:15,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:15,158 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:15,158 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:44:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:15,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-06 23:44:15,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:44:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-10-06 23:44:15,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:44:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2820 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2019-10-06 23:44:19,138 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:44:19,139 INFO L162 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-10-06 23:44:19,139 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:44:19,140 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:44:19,140 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:44:19,140 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:44:19,165 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:44:19,645 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:44:20,849 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:44:20,915 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:44:20,924 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:44:20,928 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:44:20,929 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:44:20,929 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 436#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~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_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:44:20,929 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 441#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~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_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __VERIFIER_assert_~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:44:20,930 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 72#true [2019-10-06 23:44:20,930 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 450#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:44:20,930 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,930 INFO L193 IcfgInterpreter]: Reachable states at location L38-3 satisfy 373#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,931 INFO L193 IcfgInterpreter]: Reachable states at location L46 satisfy 426#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem21| (select (select |#memory_int| |main_~#a9~0.base|) (+ (* 4 main_~x~0) |main_~#a9~0.offset|))) (= |main_#t~mem20| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= 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:44:20,931 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,931 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:44:20,931 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:44:20,931 INFO L193 IcfgInterpreter]: Reachable states at location L41-3 satisfy 416#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 455#(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:44:20,932 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,932 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:44:20,932 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,932 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 431#(exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~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_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) [2019-10-06 23:44:20,933 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:20,933 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 446#(and (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a9~0.base_BEFORE_CALL_7| Int) (|v_main_~#a9~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_~#a9~0.base_BEFORE_CALL_7|) |v_main_~#a9~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_7|) |v_main_~#a1~0.offset_BEFORE_CALL_7|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_26) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_25))))) (<= __VERIFIER_assert_~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:44:20,933 INFO L193 IcfgInterpreter]: Reachable states at location L45-3 satisfy 421#(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:44:20,933 INFO L193 IcfgInterpreter]: Reachable states at location L35-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:44:21,889 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:44:21,890 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59, 11] total 127 [2019-10-06 23:44:21,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-10-06 23:44:21,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-10-06 23:44:21,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6815, Invalid=9187, Unknown=0, NotChecked=0, Total=16002 [2019-10-06 23:44:21,900 INFO L87 Difference]: Start difference. First operand 215 states and 224 transitions. Second operand 127 states. [2019-10-06 23:44:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:44:32,166 INFO L93 Difference]: Finished difference Result 435 states and 510 transitions. [2019-10-06 23:44:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2019-10-06 23:44:32,167 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 211 [2019-10-06 23:44:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:44:32,171 INFO L225 Difference]: With dead ends: 435 [2019-10-06 23:44:32,171 INFO L226 Difference]: Without dead ends: 282 [2019-10-06 23:44:32,176 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11724 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=20208, Invalid=41048, Unknown=0, NotChecked=0, Total=61256 [2019-10-06 23:44:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-06 23:44:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 273. [2019-10-06 23:44:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-10-06 23:44:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 282 transitions. [2019-10-06 23:44:32,200 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 282 transitions. Word has length 211 [2019-10-06 23:44:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:44:32,201 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 282 transitions. [2019-10-06 23:44:32,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-10-06 23:44:32,201 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 282 transitions. [2019-10-06 23:44:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-06 23:44:32,206 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:44:32,206 INFO L385 BasicCegarLoop]: trace histogram [114, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:44:32,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:44:32,412 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:44:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:44:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash 367650944, now seen corresponding path program 8 times [2019-10-06 23:44:32,413 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:44:32,414 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:32,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:32,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:44:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:44:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:44:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7779 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2019-10-06 23:44:35,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:44:35,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:44:35,426 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