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_copy6_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:38:11,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:38:11,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:38:11,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:38:11,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:38:11,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:38:11,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:38:11,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:38:11,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:38:11,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:38:11,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:38:11,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:38:11,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:38:11,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:38:11,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:38:11,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:38:11,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:38:11,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:38:11,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:38:11,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:38:11,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:38:11,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:38:11,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:38:11,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:38:11,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:38:11,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:38:11,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:38:11,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:38:11,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:38:11,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:38:11,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:38:11,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:38:11,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:38:11,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:38:11,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:38:11,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:38:11,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:38:11,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:38:11,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:38:11,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:38:11,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:38:11,824 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:38:11,854 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:38:11,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:38:11,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:38:11,856 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:38:11,856 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:38:11,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:38:11,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:38:11,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:38:11,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:38:11,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:38:11,858 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:38:11,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:38:11,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:38:11,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:38:11,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:38:11,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:38:11,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:38:11,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:38:11,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:38:11,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:38:11,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:38:11,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:38:11,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:38:11,860 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:38:12,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:38:12,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:38:12,176 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:38:12,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:38:12,178 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:38:12,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy6_ground-1.i [2019-10-06 23:38:12,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa8b31fc/5796760e53aa434b830fbc461b2d34ed/FLAG14453680d [2019-10-06 23:38:12,766 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:38:12,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy6_ground-1.i [2019-10-06 23:38:12,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa8b31fc/5796760e53aa434b830fbc461b2d34ed/FLAG14453680d [2019-10-06 23:38:13,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa8b31fc/5796760e53aa434b830fbc461b2d34ed [2019-10-06 23:38:13,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:38:13,108 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:38:13,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:38:13,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:38:13,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:38:13,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b66671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13, skipping insertion in model container [2019-10-06 23:38:13,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:38:13,144 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:38:13,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:38:13,323 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:38:13,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:38:13,374 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:38:13,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13 WrapperNode [2019-10-06 23:38:13,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:38:13,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:38:13,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:38:13,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:38:13,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (1/1) ... [2019-10-06 23:38:13,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:38:13,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:38:13,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:38:13,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:38:13,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (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:38:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:38:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:38:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:38:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:38:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:38:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:38:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:38:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:38:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:38:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:38:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:38:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:38:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:38:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:38:14,147 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:38:14,148 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-06 23:38:14,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:38:14 BoogieIcfgContainer [2019-10-06 23:38:14,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:38:14,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:38:14,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:38:14,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:38:14,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:38:13" (1/3) ... [2019-10-06 23:38:14,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f86b531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:38:14, skipping insertion in model container [2019-10-06 23:38:14,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:38:13" (2/3) ... [2019-10-06 23:38:14,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f86b531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:38:14, skipping insertion in model container [2019-10-06 23:38:14,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:38:14" (3/3) ... [2019-10-06 23:38:14,158 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy6_ground-1.i [2019-10-06 23:38:14,168 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:38:14,176 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:38:14,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:38:14,214 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:38:14,214 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:38:14,214 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:38:14,214 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:38:14,215 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:38:14,215 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:38:14,215 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:38:14,215 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:38:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-06 23:38:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:38:14,237 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:14,238 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:14,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:14,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:14,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1527048639, now seen corresponding path program 1 times [2019-10-06 23:38:14,252 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:14,252 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,253 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:14,438 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:38:14,439 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,440 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:38:14,440 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:38:14,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:38:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:38:14,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:38:14,463 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-06 23:38:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:14,500 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-10-06 23:38:14,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:38:14,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-06 23:38:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:14,512 INFO L225 Difference]: With dead ends: 43 [2019-10-06 23:38:14,512 INFO L226 Difference]: Without dead ends: 22 [2019-10-06 23:38:14,516 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:38:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-06 23:38:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-06 23:38:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-06 23:38:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-10-06 23:38:14,562 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2019-10-06 23:38:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:14,563 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-06 23:38:14,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:38:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2019-10-06 23:38:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-06 23:38:14,565 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:14,565 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:14,565 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:14,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1172389655, now seen corresponding path program 1 times [2019-10-06 23:38:14,566 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:14,567 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:14,649 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:38:14,649 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,650 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:38:14,650 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:38:14,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:38:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:38:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:38:14,653 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand 3 states. [2019-10-06 23:38:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:14,706 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2019-10-06 23:38:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:38:14,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-06 23:38:14,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:14,708 INFO L225 Difference]: With dead ends: 42 [2019-10-06 23:38:14,708 INFO L226 Difference]: Without dead ends: 28 [2019-10-06 23:38:14,709 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:38:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-06 23:38:14,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-06 23:38:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-06 23:38:14,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-06 23:38:14,717 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 18 [2019-10-06 23:38:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:14,717 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-06 23:38:14,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:38:14,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-06 23:38:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-06 23:38:14,719 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:14,719 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] [2019-10-06 23:38:14,719 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -634654363, now seen corresponding path program 1 times [2019-10-06 23:38:14,720 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:14,721 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,721 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:38:14,847 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:14,848 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:14,848 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:38:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:14,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:38:14,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:38:15,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-06 23:38:15,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:15,122 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:15,123 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:15,139 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:15,148 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:15,149 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:15,358 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:15,938 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:38:16,216 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:38:16,519 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:38:16,817 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:38:17,383 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:17,427 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:17,443 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:17,443 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:17,444 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~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|))) (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)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:17,445 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~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|))) (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)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:17,445 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:17,445 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:17,445 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~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|))) (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)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:17,446 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,446 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,447 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:38:17,447 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:38:17,448 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,448 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:17,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:17,448 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:17,449 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,449 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_1| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#a7~0.base_BEFORE_CALL_1| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_1|) |v_main_~#a7~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|))) (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)))) [2019-10-06 23:38:17,450 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,450 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:17,451 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:17,835 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:17,835 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-06 23:38:17,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-06 23:38:17,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-06 23:38:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-10-06 23:38:17,845 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 18 states. [2019-10-06 23:38:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:18,655 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2019-10-06 23:38:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:38:18,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-06 23:38:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:18,658 INFO L225 Difference]: With dead ends: 67 [2019-10-06 23:38:18,658 INFO L226 Difference]: Without dead ends: 46 [2019-10-06 23:38:18,659 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2019-10-06 23:38:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-06 23:38:18,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2019-10-06 23:38:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-06 23:38:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-06 23:38:18,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 24 [2019-10-06 23:38:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:18,670 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-06 23:38:18,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-06 23:38:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2019-10-06 23:38:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-06 23:38:18,671 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:18,671 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:18,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:18,881 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:18,882 INFO L82 PathProgramCache]: Analyzing trace with hash 66945921, now seen corresponding path program 2 times [2019-10-06 23:38:18,882 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:18,883 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:18,883 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:18,883 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:38:19,035 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:19,036 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:19,036 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:38:19,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-06 23:38:19,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:38:19,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:38:19,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:38:19,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-06 23:38:19,169 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:19,172 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:19,173 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:19,173 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:19,175 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:19,175 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:19,207 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:20,654 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:20,668 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:20,671 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:20,672 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:20,672 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:20,672 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (<= __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:38:20,673 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:20,673 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) (<= __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:38:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,673 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,674 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:38:20,674 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:38:20,674 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,674 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:20,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:20,675 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:20,675 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,675 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a1~0.base_BEFORE_CALL_2| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a7~0.base_BEFORE_CALL_2| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (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_~#a7~0.base_BEFORE_CALL_2|) |v_main_~#a7~0.offset_BEFORE_CALL_2|)))) (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))))) [2019-10-06 23:38:20,675 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,676 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:20,676 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:20,958 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:20,958 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 11] total 19 [2019-10-06 23:38:20,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-06 23:38:20,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-06 23:38:20,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2019-10-06 23:38:20,960 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 19 states. [2019-10-06 23:38:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:21,850 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2019-10-06 23:38:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-06 23:38:21,851 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2019-10-06 23:38:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:21,853 INFO L225 Difference]: With dead ends: 94 [2019-10-06 23:38:21,853 INFO L226 Difference]: Without dead ends: 70 [2019-10-06 23:38:21,855 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:38:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-06 23:38:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2019-10-06 23:38:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-06 23:38:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2019-10-06 23:38:21,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2019-10-06 23:38:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:21,867 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2019-10-06 23:38:21,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-06 23:38:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2019-10-06 23:38:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-06 23:38:21,869 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:21,869 INFO L385 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:22,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:22,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1652751615, now seen corresponding path program 3 times [2019-10-06 23:38:22,088 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:22,088 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:22,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:22,089 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:38:22,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:22,224 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:22,224 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:38:22,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:38:22,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:38:22,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:38:22,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:38:22,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:38:22,438 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:22,440 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:22,440 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:22,441 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:22,441 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:22,442 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:22,471 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:23,791 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:23,801 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:23,804 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:23,804 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:23,805 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:23,805 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:23,805 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:23,805 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:23,806 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:23,806 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:23,806 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:23,806 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:38:23,807 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:23,807 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:38:23,807 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:23,807 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:23,807 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:23,808 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:23,808 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((|v_main_~#a1~0.base_BEFORE_CALL_3| Int) (|v_main_~#a7~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_10 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_3|) |v_main_~#a7~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|)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_10) v_prenex_12) (select (select |#memory_int| v_prenex_9) v_prenex_11))))) [2019-10-06 23:38:23,808 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:23,808 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:23,808 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:24,138 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:24,139 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-06 23:38:24,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-06 23:38:24,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-06 23:38:24,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-06 23:38:24,141 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 23 states. [2019-10-06 23:38:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:24,937 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2019-10-06 23:38:24,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-06 23:38:24,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2019-10-06 23:38:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:24,939 INFO L225 Difference]: With dead ends: 127 [2019-10-06 23:38:24,939 INFO L226 Difference]: Without dead ends: 76 [2019-10-06 23:38:24,941 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=292, Invalid=1268, Unknown=0, NotChecked=0, Total=1560 [2019-10-06 23:38:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-06 23:38:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2019-10-06 23:38:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-06 23:38:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-10-06 23:38:24,953 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 57 [2019-10-06 23:38:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:24,953 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-10-06 23:38:24,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-06 23:38:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-10-06 23:38:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:38:24,955 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:24,955 INFO L385 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:25,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:25,160 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1875901631, now seen corresponding path program 4 times [2019-10-06 23:38:25,161 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:25,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:25,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:25,162 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-06 23:38:25,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:25,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:25,463 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:38:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:25,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:38:25,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:38:25,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-06 23:38:25,970 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:25,972 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:25,972 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:25,972 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:25,973 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:25,973 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:25,995 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:26,258 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-10-06 23:38:26,468 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:38:26,919 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-10-06 23:38:27,377 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:27,386 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:27,389 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:27,389 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:27,389 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:38:27,390 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __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) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:38:27,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:27,390 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:27,390 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __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) (exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|)))))) [2019-10-06 23:38:27,390 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,391 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,391 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:38:27,391 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,391 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:38:27,391 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_16 Int) (v_prenex_15 Int) (|v_main_~#a1~0.base_BEFORE_CALL_4| Int) (|v_main_~#a7~0.base_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_4| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_14) v_prenex_16) (select (select |#memory_int| v_prenex_13) v_prenex_15)))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_4|) |v_main_~#a7~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_4|) |v_main_~#a1~0.offset_BEFORE_CALL_4|))))) [2019-10-06 23:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,392 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:27,393 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:27,752 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:27,753 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13, 11] total 41 [2019-10-06 23:38:27,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-06 23:38:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-06 23:38:27,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1300, Unknown=0, NotChecked=0, Total=1640 [2019-10-06 23:38:27,757 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 41 states. [2019-10-06 23:38:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:29,569 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2019-10-06 23:38:29,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-06 23:38:29,569 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 63 [2019-10-06 23:38:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:29,571 INFO L225 Difference]: With dead ends: 145 [2019-10-06 23:38:29,571 INFO L226 Difference]: Without dead ends: 94 [2019-10-06 23:38:29,574 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1028, Invalid=4824, Unknown=0, NotChecked=0, Total=5852 [2019-10-06 23:38:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-06 23:38:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-10-06 23:38:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-06 23:38:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2019-10-06 23:38:29,588 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 63 [2019-10-06 23:38:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:29,588 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2019-10-06 23:38:29,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-06 23:38:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2019-10-06 23:38:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-06 23:38:29,590 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:29,590 INFO L385 BasicCegarLoop]: trace histogram [22, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:29,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:29,797 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1359064847, now seen corresponding path program 5 times [2019-10-06 23:38:29,798 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:29,798 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:29,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:29,799 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:29,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-06 23:38:30,074 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:30,074 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:30,074 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:38:34,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:38:34,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:38:34,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-06 23:38:34,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 29 proven. 28 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-10-06 23:38:34,438 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-10-06 23:38:34,561 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:34,562 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:34,562 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:34,563 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:34,563 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:34,563 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:34,586 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:35,871 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:35,877 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:35,880 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:35,880 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:35,880 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:38:35,881 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __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) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:38:35,881 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:35,881 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:35,881 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __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) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|))))))) [2019-10-06 23:38:35,881 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:35,882 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:35,882 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:38:35,882 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:35,882 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:38:35,882 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:35,883 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:35,883 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:35,883 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:35,883 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a7~0.base_BEFORE_CALL_5| Int) (|v_main_~#a7~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_17) v_prenex_18) (select (select |#memory_int| v_prenex_19) v_prenex_20))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_5|) |v_main_~#a7~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_5|) |v_main_~#a1~0.offset_BEFORE_CALL_5|)))))) [2019-10-06 23:38:35,883 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:35,884 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:35,884 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:36,244 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:36,245 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11, 11] total 32 [2019-10-06 23:38:36,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-06 23:38:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-06 23:38:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-10-06 23:38:36,248 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 32 states. [2019-10-06 23:38:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:37,919 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2019-10-06 23:38:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-06 23:38:37,920 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2019-10-06 23:38:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:37,921 INFO L225 Difference]: With dead ends: 197 [2019-10-06 23:38:37,921 INFO L226 Difference]: Without dead ends: 148 [2019-10-06 23:38:37,923 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=2456, Unknown=0, NotChecked=0, Total=3192 [2019-10-06 23:38:37,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-06 23:38:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2019-10-06 23:38:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-06 23:38:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2019-10-06 23:38:37,949 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 81 [2019-10-06 23:38:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:37,950 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2019-10-06 23:38:37,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-06 23:38:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2019-10-06 23:38:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-06 23:38:37,958 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:37,958 INFO L385 BasicCegarLoop]: trace histogram [22, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:38,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:38,159 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:38,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:38,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1413846399, now seen corresponding path program 6 times [2019-10-06 23:38:38,160 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:38,160 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:38,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:38,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 933 trivial. 0 not checked. [2019-10-06 23:38:39,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:39,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:39,135 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:38:39,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:38:39,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:38:39,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:38:39,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-10-06 23:38:39,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2019-10-06 23:38:40,906 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:40,911 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:40,912 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:40,913 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:40,913 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:40,913 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:40,937 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:42,287 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:42,294 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:42,297 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:42,297 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:42,298 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:38:42,298 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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:38:42,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:42,298 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:42,299 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __VERIFIER_assert_~cond 0) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) (<= 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:38:42,299 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,299 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,299 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:38:42,300 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,300 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:38:42,300 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:42,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:42,300 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:42,301 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,301 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (v_prenex_24 Int) (|v_main_~#a7~0.base_BEFORE_CALL_6| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_6| Int) (v_prenex_21 Int) (|v_main_~#a1~0.base_BEFORE_CALL_6| Int) (|v_main_~#a1~0.offset_BEFORE_CALL_6| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_23) v_prenex_24) (select (select |#memory_int| v_prenex_21) v_prenex_22)))) (and (= (select (select |#memory_int| |v_main_~#a1~0.base_BEFORE_CALL_6|) |v_main_~#a1~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_6|) |v_main_~#a7~0.offset_BEFORE_CALL_6|)) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:38:42,301 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,301 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:42,301 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:42,833 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:42,833 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25, 25, 11] total 75 [2019-10-06 23:38:42,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-10-06 23:38:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-10-06 23:38:42,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=4223, Unknown=0, NotChecked=0, Total=5550 [2019-10-06 23:38:42,838 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 75 states. [2019-10-06 23:38:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:38:47,092 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2019-10-06 23:38:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-06 23:38:47,092 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 135 [2019-10-06 23:38:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:38:47,094 INFO L225 Difference]: With dead ends: 289 [2019-10-06 23:38:47,094 INFO L226 Difference]: Without dead ends: 178 [2019-10-06 23:38:47,100 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4998 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4009, Invalid=16871, Unknown=0, NotChecked=0, Total=20880 [2019-10-06 23:38:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-06 23:38:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2019-10-06 23:38:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-06 23:38:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 176 transitions. [2019-10-06 23:38:47,132 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 176 transitions. Word has length 135 [2019-10-06 23:38:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:38:47,133 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 176 transitions. [2019-10-06 23:38:47,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-10-06 23:38:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2019-10-06 23:38:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-06 23:38:47,135 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:38:47,135 INFO L385 BasicCegarLoop]: trace histogram [46, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:38:47,340 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:38:47,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:38:47,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:38:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1171288655, now seen corresponding path program 7 times [2019-10-06 23:38:47,342 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:38:47,343 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:47,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:47,343 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:38:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:38:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 1846 trivial. 0 not checked. [2019-10-06 23:38:48,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:38:48,636 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:38:48,636 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:38:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:38:48,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-06 23:38:48,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:38:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-10-06 23:38:50,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:38:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2019-10-06 23:38:53,029 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:38:53,030 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-06 23:38:53,031 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:38:53,031 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:38:53,031 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:38:53,031 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:38:53,051 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:38:54,331 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-06 23:38:54,337 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:38:54,341 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:38:54,341 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:38:54,341 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 350#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~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|))))))) [2019-10-06 23:38:54,342 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 355#(and (<= __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) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~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|))))))) [2019-10-06 23:38:54,342 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 364#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:38:54,342 INFO L193 IcfgInterpreter]: Reachable states at location L37-3 satisfy 335#(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:38:54,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 360#(and (<= __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) (exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~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|))))))) [2019-10-06 23:38:54,343 INFO L193 IcfgInterpreter]: Reachable states at location L27-3 satisfy 244#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,343 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 115#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,343 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:38:54,343 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 287#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,343 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:38:54,344 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 340#(and (<= 100000 main_~a~0) (< main_~x~0 100000) (<= 0 main_~i~0) (= |main_#t~mem16| (select (select |#memory_int| |main_~#a1~0.base|) (+ (* 4 main_~x~0) |main_~#a1~0.offset|))) (= main_~x~0 0) (= |main_#t~mem17| (select (select |#memory_int| |main_~#a7~0.base|) (+ (* 4 main_~x~0) |main_~#a7~0.offset|))) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:38:54,344 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 369#(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:38:54,344 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:38:54,344 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 158#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,344 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 345#(exists ((v_prenex_27 Int) (|v_main_~#a7~0.base_BEFORE_CALL_7| Int) (v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int) (|v_main_~#a1~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a7~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a1~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_25) v_prenex_27) (select (select |#memory_int| v_prenex_28) v_prenex_26))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#a7~0.base_BEFORE_CALL_7|) |v_main_~#a7~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|)))))) [2019-10-06 23:38:54,345 INFO L193 IcfgInterpreter]: Reachable states at location L33-3 satisfy 330#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,345 INFO L193 IcfgInterpreter]: Reachable states at location L13-3 satisfy 72#true [2019-10-06 23:38:54,345 INFO L193 IcfgInterpreter]: Reachable states at location L24-3 satisfy 201#(and (<= 100000 main_~a~0) (<= 0 main_~i~0)) [2019-10-06 23:38:54,953 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:38:54,953 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 49, 49, 11] total 124 [2019-10-06 23:38:54,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-10-06 23:38:54,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-10-06 23:38:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4778, Invalid=10474, Unknown=0, NotChecked=0, Total=15252 [2019-10-06 23:38:54,961 INFO L87 Difference]: Start difference. First operand 169 states and 176 transitions. Second operand 124 states. [2019-10-06 23:39:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:39:04,759 INFO L93 Difference]: Finished difference Result 349 states and 416 transitions. [2019-10-06 23:39:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-10-06 23:39:04,760 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 165 [2019-10-06 23:39:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:39:04,762 INFO L225 Difference]: With dead ends: 349 [2019-10-06 23:39:04,762 INFO L226 Difference]: Without dead ends: 232 [2019-10-06 23:39:04,769 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12817 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14364, Invalid=44442, Unknown=0, NotChecked=0, Total=58806 [2019-10-06 23:39:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-06 23:39:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2019-10-06 23:39:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-06 23:39:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 230 transitions. [2019-10-06 23:39:04,789 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 230 transitions. Word has length 165 [2019-10-06 23:39:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:39:04,789 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 230 transitions. [2019-10-06 23:39:04,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-10-06 23:39:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 230 transitions. [2019-10-06 23:39:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-06 23:39:04,792 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:39:04,793 INFO L385 BasicCegarLoop]: trace histogram [94, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:39:05,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:39:05,001 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:39:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:39:05,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1618449729, now seen corresponding path program 8 times [2019-10-06 23:39:05,002 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:39:05,003 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:39:05,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:05,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:39:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:39:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:39:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5491 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2019-10-06 23:39:06,526 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:39:06,526 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:39:06,526 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