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/sorting_bubblesort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-06 23:18:31,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-06 23:18:31,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-06 23:18:31,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-06 23:18:31,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-06 23:18:31,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-06 23:18:31,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-06 23:18:31,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-06 23:18:31,760 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-06 23:18:31,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-06 23:18:31,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-06 23:18:31,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-06 23:18:31,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-06 23:18:31,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-06 23:18:31,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-06 23:18:31,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-06 23:18:31,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-06 23:18:31,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-06 23:18:31,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-06 23:18:31,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-06 23:18:31,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-06 23:18:31,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-06 23:18:31,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-06 23:18:31,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-06 23:18:31,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-06 23:18:31,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-06 23:18:31,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-06 23:18:31,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-06 23:18:31,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-06 23:18:31,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-06 23:18:31,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-06 23:18:31,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-06 23:18:31,794 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-06 23:18:31,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-06 23:18:31,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-06 23:18:31,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-06 23:18:31,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-06 23:18:31,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-06 23:18:31,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-06 23:18:31,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-06 23:18:31,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-06 23:18:31,800 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:18:31,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-06 23:18:31,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-06 23:18:31,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-06 23:18:31,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-06 23:18:31,815 INFO L138 SettingsManager]: * Use SBE=true [2019-10-06 23:18:31,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-06 23:18:31,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-06 23:18:31,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-06 23:18:31,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-06 23:18:31,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-06 23:18:31,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-06 23:18:31,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-06 23:18:31,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-06 23:18:31,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-06 23:18:31,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-06 23:18:31,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-06 23:18:31,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-06 23:18:31,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-06 23:18:31,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-06 23:18:31,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-06 23:18:31,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-06 23:18:31,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-06 23:18:31,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-06 23:18:31,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-06 23:18:31,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-06 23:18:31,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-06 23:18:31,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-06 23:18:31,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-06 23:18:31,820 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:18:32,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-06 23:18:32,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-06 23:18:32,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-06 23:18:32,155 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-06 23:18:32,155 INFO L275 PluginConnector]: CDTParser initialized [2019-10-06 23:18:32,156 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-06 23:18:32,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d880f32/34245021452b4b5e8264e0ac7aa0a4ff/FLAGd0843a30e [2019-10-06 23:18:32,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-06 23:18:32,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-2.i [2019-10-06 23:18:32,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d880f32/34245021452b4b5e8264e0ac7aa0a4ff/FLAGd0843a30e [2019-10-06 23:18:33,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d880f32/34245021452b4b5e8264e0ac7aa0a4ff [2019-10-06 23:18:33,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-06 23:18:33,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-06 23:18:33,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:33,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-06 23:18:33,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-06 23:18:33,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de122ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33, skipping insertion in model container [2019-10-06 23:18:33,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-06 23:18:33,116 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-06 23:18:33,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:33,335 INFO L188 MainTranslator]: Completed pre-run [2019-10-06 23:18:33,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-06 23:18:33,454 INFO L192 MainTranslator]: Completed translation [2019-10-06 23:18:33,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33 WrapperNode [2019-10-06 23:18:33,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-06 23:18:33,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-06 23:18:33,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-06 23:18:33,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-06 23:18:33,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (1/1) ... [2019-10-06 23:18:33,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-06 23:18:33,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-06 23:18:33,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-06 23:18:33,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-06 23:18:33,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (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:18:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-06 23:18:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-06 23:18:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-06 23:18:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-06 23:18:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-06 23:18:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-06 23:18:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-06 23:18:33,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-06 23:18:33,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-06 23:18:33,955 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-06 23:18:33,955 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-06 23:18:33,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:33 BoogieIcfgContainer [2019-10-06 23:18:33,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-06 23:18:33,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-06 23:18:33,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-06 23:18:33,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-06 23:18:33,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 11:18:33" (1/3) ... [2019-10-06 23:18:33,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2eac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:33, skipping insertion in model container [2019-10-06 23:18:33,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 11:18:33" (2/3) ... [2019-10-06 23:18:33,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2eac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 11:18:33, skipping insertion in model container [2019-10-06 23:18:33,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 11:18:33" (3/3) ... [2019-10-06 23:18:33,965 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-2.i [2019-10-06 23:18:33,975 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-06 23:18:33,983 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-06 23:18:34,000 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-06 23:18:34,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-06 23:18:34,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-06 23:18:34,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-06 23:18:34,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-06 23:18:34,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-06 23:18:34,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-06 23:18:34,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-06 23:18:34,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-06 23:18:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-06 23:18:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-06 23:18:34,046 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:34,047 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:34,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-06 23:18:34,061 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:34,062 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:34,237 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:18:34,238 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,239 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:34,239 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:34,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:34,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:34,263 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-06 23:18:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:34,321 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-06 23:18:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:34,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-06 23:18:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:34,333 INFO L225 Difference]: With dead ends: 37 [2019-10-06 23:18:34,333 INFO L226 Difference]: Without dead ends: 19 [2019-10-06 23:18:34,337 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:18:34,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-06 23:18:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-06 23:18:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-06 23:18:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-06 23:18:34,381 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-06 23:18:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:34,381 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-06 23:18:34,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-06 23:18:34,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-06 23:18:34,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:34,387 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:34,388 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-06 23:18:34,389 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:34,389 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,390 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:34,474 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:18:34,475 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,476 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:34,476 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:34,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:34,479 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-06 23:18:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:34,500 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-06 23:18:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:34,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-06 23:18:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:34,502 INFO L225 Difference]: With dead ends: 30 [2019-10-06 23:18:34,503 INFO L226 Difference]: Without dead ends: 20 [2019-10-06 23:18:34,504 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:18:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-06 23:18:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-06 23:18:34,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-06 23:18:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-06 23:18:34,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-06 23:18:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:34,515 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-06 23:18:34,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-06 23:18:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-06 23:18:34,517 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:34,517 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:34,517 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:34,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-06 23:18:34,518 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:34,518 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,518 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,519 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:34,578 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,578 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-06 23:18:34,581 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-06 23:18:34,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-06 23:18:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-06 23:18:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-06 23:18:34,583 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-06 23:18:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:34,604 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-06 23:18:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-06 23:18:34,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-06 23:18:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:34,607 INFO L225 Difference]: With dead ends: 33 [2019-10-06 23:18:34,608 INFO L226 Difference]: Without dead ends: 21 [2019-10-06 23:18:34,608 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:18:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-06 23:18:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-06 23:18:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-06 23:18:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-06 23:18:34,618 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-06 23:18:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:34,619 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-06 23:18:34,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-06 23:18:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-06 23:18:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-06 23:18:34,620 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:34,620 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:18:34,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-06 23:18:34,622 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:34,622 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,623 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,623 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-06 23:18:34,701 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:34,702 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:34,702 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:18:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:34,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-06 23:18:34,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:18:34,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-06 23:18:34,844 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:34,871 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:34,871 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:34,878 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:34,886 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:34,887 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:35,088 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:35,553 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:35,577 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:35,588 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:35,588 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:35,589 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:35,589 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:35,590 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:35,590 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:35,591 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:35,591 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:35,591 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:35,592 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:35,592 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:18:35,593 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:18:35,594 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:35,594 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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:18:35,594 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:35,595 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_2 Int) (v_prenex_1 Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (<= (select (select |#memory_int| v_prenex_2) v_prenex_1) (select (select |#memory_int| v_prenex_2) (+ v_prenex_1 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (+ |v_main_~#a~0.offset_BEFORE_CALL_1| 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-06 23:18:35,595 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:36,167 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:36,168 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 20 [2019-10-06 23:18:36,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-06 23:18:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-06 23:18:36,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-06 23:18:36,171 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 20 states. [2019-10-06 23:18:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:37,143 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2019-10-06 23:18:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-06 23:18:37,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2019-10-06 23:18:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:37,146 INFO L225 Difference]: With dead ends: 52 [2019-10-06 23:18:37,147 INFO L226 Difference]: Without dead ends: 38 [2019-10-06 23:18:37,148 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2019-10-06 23:18:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-06 23:18:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-10-06 23:18:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-06 23:18:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-06 23:18:37,160 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2019-10-06 23:18:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:37,161 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-06 23:18:37,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-06 23:18:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-06 23:18:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-06 23:18:37,162 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:37,162 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:37,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:37,372 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:37,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1290059680, now seen corresponding path program 2 times [2019-10-06 23:18:37,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:37,374 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:37,374 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:37,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:37,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:37,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:37,481 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:37,481 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:18:37,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:37,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:37,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-06 23:18:37,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:37,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:37,660 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:37,661 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:37,662 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:37,662 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:37,662 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:37,663 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:37,717 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:38,097 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:38,108 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:38,114 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:38,115 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:38,119 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:38,119 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:38,119 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:38,124 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:38,125 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:38,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:38,126 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:18:38,126 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:18:38,126 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:38,126 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:18:38,127 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:38,127 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_4 Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int)) (or (and (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_4) v_prenex_5) (select (select |#memory_int| v_prenex_4) (+ v_prenex_5 4))))))) [2019-10-06 23:18:38,127 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:38,539 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:38,539 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-06 23:18:38,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-06 23:18:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-06 23:18:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-06 23:18:38,541 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 25 states. [2019-10-06 23:18:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:39,412 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2019-10-06 23:18:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-06 23:18:39,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-10-06 23:18:39,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:39,413 INFO L225 Difference]: With dead ends: 61 [2019-10-06 23:18:39,414 INFO L226 Difference]: Without dead ends: 44 [2019-10-06 23:18:39,415 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2019-10-06 23:18:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-06 23:18:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-06 23:18:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-06 23:18:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-06 23:18:39,423 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2019-10-06 23:18:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:39,424 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-06 23:18:39,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-06 23:18:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-06 23:18:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-06 23:18:39,425 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:39,425 INFO L385 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:39,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:39,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -799533856, now seen corresponding path program 3 times [2019-10-06 23:18:39,631 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:39,631 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:39,631 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:39,631 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:39,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:39,761 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:39,761 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:18:39,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:39,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:39,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-06 23:18:39,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:39,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:40,082 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:40,084 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:40,084 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:40,085 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:40,085 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:40,085 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:40,118 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:40,361 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:40,374 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:40,383 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:40,384 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:40,384 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:40,384 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:40,385 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:40,385 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:40,385 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:40,386 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:40,386 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:40,388 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:40,389 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:18:40,389 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:18:40,389 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:40,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:18:40,390 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:40,390 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_6) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_7 4))))))) [2019-10-06 23:18:40,391 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:40,842 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:40,842 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-06 23:18:40,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-06 23:18:40,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-06 23:18:40,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-06 23:18:40,845 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 37 states. [2019-10-06 23:18:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:42,270 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-10-06 23:18:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-06 23:18:42,271 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 27 [2019-10-06 23:18:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:42,273 INFO L225 Difference]: With dead ends: 73 [2019-10-06 23:18:42,273 INFO L226 Difference]: Without dead ends: 56 [2019-10-06 23:18:42,278 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1253 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=974, Invalid=3718, Unknown=0, NotChecked=0, Total=4692 [2019-10-06 23:18:42,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-06 23:18:42,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-10-06 23:18:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-06 23:18:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-06 23:18:42,288 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 27 [2019-10-06 23:18:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:42,289 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-06 23:18:42,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-06 23:18:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-06 23:18:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-06 23:18:42,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:42,290 INFO L385 BasicCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:42,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:42,496 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash 317038048, now seen corresponding path program 4 times [2019-10-06 23:18:42,496 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:42,496 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:42,496 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:42,497 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:42,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:42,866 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:42,866 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:18:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:42,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-06 23:18:42,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:42,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:43,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:43,665 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:43,665 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:43,665 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:43,666 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:43,666 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:43,694 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:43,829 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:43,835 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:43,838 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:43,841 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:43,841 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,842 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,842 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:43,842 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:43,843 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:43,843 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:43,844 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:43,844 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:43,844 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:18:43,844 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:18:43,845 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:43,845 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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:18:43,849 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:43,849 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_8 Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_8) v_prenex_9) (select (select |#memory_int| v_prenex_8) (+ v_prenex_9 4))))))) [2019-10-06 23:18:43,849 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:44,407 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:44,408 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-06 23:18:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-06 23:18:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-06 23:18:44,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-06 23:18:44,412 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 61 states. [2019-10-06 23:18:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:47,339 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2019-10-06 23:18:47,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-06 23:18:47,340 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 39 [2019-10-06 23:18:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:47,341 INFO L225 Difference]: With dead ends: 97 [2019-10-06 23:18:47,341 INFO L226 Difference]: Without dead ends: 80 [2019-10-06 23:18:47,345 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-06 23:18:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-06 23:18:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 69. [2019-10-06 23:18:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-06 23:18:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-06 23:18:47,357 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 39 [2019-10-06 23:18:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:47,357 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-06 23:18:47,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-06 23:18:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-06 23:18:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-06 23:18:47,359 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:47,359 INFO L385 BasicCegarLoop]: trace histogram [46, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:47,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:47,566 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:47,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1926221856, now seen corresponding path program 5 times [2019-10-06 23:18:47,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:47,567 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:47,567 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:47,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-06 23:18:48,608 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:48,608 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:48,608 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:18:48,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-06 23:18:48,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:48,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-06 23:18:48,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:48,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-06 23:18:48,865 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:48,866 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:48,866 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:48,867 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:48,867 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:48,867 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:48,883 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:49,013 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:49,019 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:49,022 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:49,022 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:49,022 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:49,022 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:49,023 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:49,023 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:49,023 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:49,023 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:49,023 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:49,024 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:49,024 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:18:49,024 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:49,024 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:18:49,024 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:18:49,025 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:49,025 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_10) v_prenex_11) (select (select |#memory_int| v_prenex_10) (+ v_prenex_11 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (+ |v_main_~#a~0.offset_BEFORE_CALL_5| 4)))))) [2019-10-06 23:18:49,025 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:49,776 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:49,776 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 5, 5, 13] total 67 [2019-10-06 23:18:49,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-06 23:18:49,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-06 23:18:49,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=3180, Unknown=0, NotChecked=0, Total=4422 [2019-10-06 23:18:49,780 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 67 states. [2019-10-06 23:18:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:18:53,702 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2019-10-06 23:18:53,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-06 23:18:53,703 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-10-06 23:18:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:18:53,705 INFO L225 Difference]: With dead ends: 102 [2019-10-06 23:18:53,705 INFO L226 Difference]: Without dead ends: 85 [2019-10-06 23:18:53,710 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3742, Invalid=13028, Unknown=0, NotChecked=0, Total=16770 [2019-10-06 23:18:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-10-06 23:18:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2019-10-06 23:18:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-06 23:18:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2019-10-06 23:18:53,720 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 63 [2019-10-06 23:18:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:18:53,720 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2019-10-06 23:18:53,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-06 23:18:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2019-10-06 23:18:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-06 23:18:53,722 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:18:53,723 INFO L385 BasicCegarLoop]: trace histogram [47, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:18:53,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:18:53,927 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:18:53,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:18:53,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1382067436, now seen corresponding path program 6 times [2019-10-06 23:18:53,928 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:18:53,928 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:53,929 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:53,929 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:18:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:18:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:18:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:54,956 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:18:54,956 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:18:54,957 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:18:55,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:18:55,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:18:55,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-06 23:18:55,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:18:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:55,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:18:57,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:18:57,595 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:18:57,597 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:18:57,597 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:18:57,597 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:18:57,597 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:18:57,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:18:57,615 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:18:57,732 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:18:57,741 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:18:57,743 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:18:57,743 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:18:57,744 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:57,744 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:57,744 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:18:57,744 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:18:57,745 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:18:57,745 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:18:57,745 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:18:57,745 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:18:57,745 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:18:57,746 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:18:57,746 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:18:57,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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:18:57,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:18:57,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_12 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_13 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_13) v_prenex_12) (select (select |#memory_int| v_prenex_13) (+ v_prenex_12 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) (+ |v_main_~#a~0.offset_BEFORE_CALL_6| 4))))))) [2019-10-06 23:18:57,746 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:18:58,402 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:18:58,403 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-06 23:18:58,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-06 23:18:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-06 23:18:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-06 23:18:58,409 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 111 states. [2019-10-06 23:19:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:19:05,762 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2019-10-06 23:19:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-06 23:19:05,763 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 68 [2019-10-06 23:19:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:19:05,765 INFO L225 Difference]: With dead ends: 155 [2019-10-06 23:19:05,765 INFO L226 Difference]: Without dead ends: 134 [2019-10-06 23:19:05,768 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-06 23:19:05,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-06 23:19:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 123. [2019-10-06 23:19:05,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-06 23:19:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-06 23:19:05,783 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 68 [2019-10-06 23:19:05,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:19:05,784 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-06 23:19:05,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-06 23:19:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-06 23:19:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-06 23:19:05,786 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:19:05,786 INFO L385 BasicCegarLoop]: trace histogram [96, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:19:05,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:05,990 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:19:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:19:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash -693506848, now seen corresponding path program 7 times [2019-10-06 23:19:05,990 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:19:05,991 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:05,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:05,991 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:09,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:09,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:09,463 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:09,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 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:19:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:09,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-06 23:19:09,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:09,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:19:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4678 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:19,556 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:19:19,557 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:19:19,558 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:19:19,558 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:19:19,558 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:19:19,558 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:19:19,576 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:19:19,720 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:19:19,725 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:19:19,728 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:19:19,728 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:19:19,728 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 177#(and (exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_15) (+ v_prenex_14 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:19,728 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 182#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_15) (+ v_prenex_14 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:19,729 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 191#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:19:19,729 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 132#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:19:19,729 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 127#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:19:19,729 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 142#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:19:19,729 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:19:19,730 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 187#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_15) (+ v_prenex_14 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:19:19,730 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:19:19,730 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 168#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:19:19,730 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:19:19,730 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 196#(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:19:19,731 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:19:19,731 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 172#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (v_prenex_14 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_15) v_prenex_14) (select (select |#memory_int| v_prenex_15) (+ v_prenex_14 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) |v_main_~#a~0.offset_BEFORE_CALL_7|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ |v_main_~#a~0.offset_BEFORE_CALL_7| 4)))))) [2019-10-06 23:19:19,731 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 163#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:19:20,751 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:19:20,751 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99, 13] total 209 [2019-10-06 23:19:20,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 209 states [2019-10-06 23:19:20,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2019-10-06 23:19:20,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19345, Invalid=24127, Unknown=0, NotChecked=0, Total=43472 [2019-10-06 23:19:20,758 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 209 states. [2019-10-06 23:19:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:19:45,259 INFO L93 Difference]: Finished difference Result 253 states and 360 transitions. [2019-10-06 23:19:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2019-10-06 23:19:45,260 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 117 [2019-10-06 23:19:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:19:45,263 INFO L225 Difference]: With dead ends: 253 [2019-10-06 23:19:45,263 INFO L226 Difference]: Without dead ends: 232 [2019-10-06 23:19:45,269 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 411 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31310 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=57648, Invalid=112508, Unknown=0, NotChecked=0, Total=170156 [2019-10-06 23:19:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-06 23:19:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2019-10-06 23:19:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-06 23:19:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-06 23:19:45,294 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 117 [2019-10-06 23:19:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:19:45,295 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-06 23:19:45,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 209 states. [2019-10-06 23:19:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-06 23:19:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-06 23:19:45,298 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:19:45,298 INFO L385 BasicCegarLoop]: trace histogram [194, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:19:45,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:45,503 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:19:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:19:45,504 INFO L82 PathProgramCache]: Analyzing trace with hash -833386912, now seen corresponding path program 8 times [2019-10-06 23:19:45,504 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:19:45,504 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:45,504 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:45,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:19:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:19:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:19:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-06 23:19:59,033 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:19:59,034 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:19:59,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:19:59,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-06 23:19:59,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:19:59,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-06 23:19:59,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:19:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:19:59,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:20:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18937 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 18915 trivial. 0 not checked. [2019-10-06 23:20:00,477 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:20:00,479 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:20:00,479 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:20:00,479 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:20:00,480 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:20:00,480 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:20:00,497 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:20:00,636 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:20:00,642 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:20:00,646 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:20:00,647 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:20:00,647 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:20:00,647 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:20:00,647 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:20:00,647 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:20:00,647 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:20:00,648 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:20:00,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:20:00,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:20:00,649 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((v_prenex_18 Int) (v_prenex_17 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#a~0.offset_BEFORE_CALL_8| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_17) (+ v_prenex_18 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) |v_main_~#a~0.offset_BEFORE_CALL_8|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) (+ |v_main_~#a~0.offset_BEFORE_CALL_8| 4))))))) [2019-10-06 23:20:00,649 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:20:02,361 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:20:02,361 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [197, 9, 9, 13] total 223 [2019-10-06 23:20:02,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 223 states [2019-10-06 23:20:02,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2019-10-06 23:20:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19464, Invalid=30042, Unknown=0, NotChecked=0, Total=49506 [2019-10-06 23:20:02,367 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 223 states. [2019-10-06 23:20:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:20:32,083 INFO L93 Difference]: Finished difference Result 262 states and 280 transitions. [2019-10-06 23:20:32,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2019-10-06 23:20:32,084 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 215 [2019-10-06 23:20:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:20:32,088 INFO L225 Difference]: With dead ends: 262 [2019-10-06 23:20:32,088 INFO L226 Difference]: Without dead ends: 241 [2019-10-06 23:20:32,096 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1061 GetRequests, 621 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31469 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=58424, Invalid=136498, Unknown=0, NotChecked=0, Total=194922 [2019-10-06 23:20:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-06 23:20:32,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2019-10-06 23:20:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-06 23:20:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 234 transitions. [2019-10-06 23:20:32,116 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 234 transitions. Word has length 215 [2019-10-06 23:20:32,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:20:32,116 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 234 transitions. [2019-10-06 23:20:32,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 223 states. [2019-10-06 23:20:32,117 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 234 transitions. [2019-10-06 23:20:32,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-06 23:20:32,120 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:20:32,120 INFO L385 BasicCegarLoop]: trace histogram [195, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:20:32,324 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:32,324 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:20:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:20:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2098159852, now seen corresponding path program 9 times [2019-10-06 23:20:32,326 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:20:32,326 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:32,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:32,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:20:32,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:20:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:20:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:46,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:20:46,050 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:20:46,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:20:46,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-06 23:20:46,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-06 23:20:46,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 197 conjunts are in the unsatisfiable core [2019-10-06 23:20:46,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:20:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:20:46,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:21:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19216 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:21:26,797 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:21:26,799 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:21:26,799 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:21:26,799 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:21:26,800 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:21:26,800 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:21:26,828 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:21:26,997 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:21:27,003 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:21:27,005 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:21:27,005 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:21:27,005 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_21) (select (select |#memory_int| v_prenex_20) (+ v_prenex_21 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:27,005 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_21) (select (select |#memory_int| v_prenex_20) (+ v_prenex_21 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_21) (select (select |#memory_int| v_prenex_20) (+ v_prenex_21 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-06 23:21:27,006 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:21:27,006 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:21:27,006 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:21:27,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:21:27,007 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:21:27,007 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (v_prenex_21 Int) (v_prenex_20 Int) (|v_main_~#a~0.offset_BEFORE_CALL_9| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (<= (select (select |#memory_int| v_prenex_20) v_prenex_21) (select (select |#memory_int| v_prenex_20) (+ v_prenex_21 4)))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) |v_main_~#a~0.offset_BEFORE_CALL_9|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) (+ |v_main_~#a~0.offset_BEFORE_CALL_9| 4))))))) [2019-10-06 23:21:27,007 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:21:28,668 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:21:28,668 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [198, 198, 198, 13] total 407 [2019-10-06 23:21:28,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 407 states [2019-10-06 23:21:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 407 interpolants. [2019-10-06 23:21:28,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77854, Invalid=87388, Unknown=0, NotChecked=0, Total=165242 [2019-10-06 23:21:28,682 INFO L87 Difference]: Start difference. First operand 230 states and 234 transitions. Second operand 407 states. [2019-10-06 23:22:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-06 23:22:58,024 INFO L93 Difference]: Finished difference Result 467 states and 673 transitions. [2019-10-06 23:22:58,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 407 states. [2019-10-06 23:22:58,025 INFO L78 Accepts]: Start accepts. Automaton has 407 states. Word has length 224 [2019-10-06 23:22:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-06 23:22:58,027 INFO L225 Difference]: With dead ends: 467 [2019-10-06 23:22:58,028 INFO L226 Difference]: Without dead ends: 438 [2019-10-06 23:22:58,050 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 1272 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 807 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111698 ImplicationChecksByTransitivity, 138.8s TimeCoverageRelationStatistics Valid=232779, Invalid=420893, Unknown=0, NotChecked=0, Total=653672 [2019-10-06 23:22:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-10-06 23:22:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 427. [2019-10-06 23:22:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-10-06 23:22:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 431 transitions. [2019-10-06 23:22:58,073 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 431 transitions. Word has length 224 [2019-10-06 23:22:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-06 23:22:58,074 INFO L462 AbstractCegarLoop]: Abstraction has 427 states and 431 transitions. [2019-10-06 23:22:58,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 407 states. [2019-10-06 23:22:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 431 transitions. [2019-10-06 23:22:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-10-06 23:22:58,083 INFO L377 BasicCegarLoop]: Found error trace [2019-10-06 23:22:58,083 INFO L385 BasicCegarLoop]: trace histogram [392, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-06 23:22:58,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:22:58,292 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-06 23:22:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-06 23:22:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1391142432, now seen corresponding path program 10 times [2019-10-06 23:22:58,293 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-06 23:22:58,293 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:22:58,294 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:58,294 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-06 23:22:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-06 23:22:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:52,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-06 23:23:52,651 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-06 23:23:52,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-06 23:23:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-06 23:23:53,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 2474 conjuncts, 394 conjunts are in the unsatisfiable core [2019-10-06 23:23:53,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-06 23:23:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:23:53,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-06 23:26:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 77134 backedges. 0 proven. 77028 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-06 23:26:37,397 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-06 23:26:37,399 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-06 23:26:37,399 INFO L169 IcfgInterpreter]: Building call graph [2019-10-06 23:26:37,399 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-06 23:26:37,399 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-06 23:26:37,400 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-06 23:26:37,428 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-06 23:26:37,593 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-06 23:26:37,598 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-06 23:26:37,600 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-06 23:26:37,600 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-06 23:26:37,600 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (<= (select (select |#memory_int| v_prenex_23) v_prenex_22) (select (select |#memory_int| v_prenex_23) (+ v_prenex_22 4))) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(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_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (<= (select (select |#memory_int| v_prenex_23) v_prenex_22) (select (select |#memory_int| v_prenex_23) (+ v_prenex_22 4))) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 219#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 160#(and (or (<= 100000 main_~i~0) (and (<= 1 main_~swapped~0) (<= main_~swapped~0 1))) (or (and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000))) (and (not (< main_~j~0 100000)) (<= 1 main_~swapped~0) (<= main_~swapped~0 1) (<= 100000 main_~j~0) (= 1 main_~swapped~0)))) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 155#(and (<= 0 main_~swapped~0) (<= 1 main_~i~0) (<= 100000 main_~j~0)) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location L29-3 satisfy 170#(and (<= 0 main_~swapped~0) (or (and (<= 1 main_~i~0) (= main_~x~0 0) (not (< main_~i~0 100000)) (= 0 main_~swapped~0)) (and (= main_~x~0 0) (not (< main_~j~0 100000)) (= 0 main_~swapped~0) (= 1 main_~swapped~0))) (<= main_~swapped~0 0) (<= 100000 main_~i~0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-06 23:26:37,601 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-06 23:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(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_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (<= (select (select |#memory_int| v_prenex_23) v_prenex_22) (select (select |#memory_int| v_prenex_23) (+ v_prenex_22 4))) (= |__VERIFIER_assert_#in~cond| 1))))) [2019-10-06 23:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-06 23:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 196#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (= main_~x~0 0) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-06 23:26:37,602 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:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 224#(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:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-06 23:26:37,602 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.offset_BEFORE_CALL_10| Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) |v_main_~#a~0.offset_BEFORE_CALL_10|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (+ |v_main_~#a~0.offset_BEFORE_CALL_10| 4))))) (and (<= (select (select |#memory_int| v_prenex_23) v_prenex_22) (select (select |#memory_int| v_prenex_23) (+ v_prenex_22 4))) (= |__VERIFIER_assert_#in~cond| 1)))) [2019-10-06 23:26:37,603 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (<= 100000 main_~j~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (= 0 main_~swapped~0) (<= 0 main_~x~0) (< main_~x~0 100000) (<= 1 main_~i~0) (<= main_~swapped~0 0) (< main_~y~0 100000) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~x~0) |main_~#a~0.offset|)) |main_#t~mem8|) (<= 100000 main_~i~0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~y~0) |main_~#a~0.offset|))) (<= main_~y~0 1)) [2019-10-06 23:26:40,642 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-06 23:26:40,642 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [395, 395, 395, 13] total 801 [2019-10-06 23:26:40,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 801 states [2019-10-06 23:26:40,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 801 interpolants. [2019-10-06 23:26:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310905, Invalid=329895, Unknown=0, NotChecked=0, Total=640800 [2019-10-06 23:26:40,686 INFO L87 Difference]: Start difference. First operand 427 states and 431 transitions. Second operand 801 states.