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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:41,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:41,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:41,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:41,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:41,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:41,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:41,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:41,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:41,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:41,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:41,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:41,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:41,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:41,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:41,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:41,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:41,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:41,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:41,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:41,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:41,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:41,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:41,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:41,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:41,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:41,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:41,156 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:41,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:41,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:41,158 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:41,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:41,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:41,165 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:41,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:41,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:41,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:41,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:41,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:41,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:41,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:41,177 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-13 21:32:41,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:41,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:41,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:41,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:41,201 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:41,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:41,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:41,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:41,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:41,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:41,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:41,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:41,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:41,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:41,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:41,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:41,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:41,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:41,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:41,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:41,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:41,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:41,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:41,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:41,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:41,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:41,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:41,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:41,206 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-13 21:32:41,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:41,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:41,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:41,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:41,506 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:41,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-13 21:32:41,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4b645cc/e8169bf395184404922c050b0c987beb/FLAGef4093cf3 [2019-10-13 21:32:42,038 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:42,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_bubblesort_ground-1.i [2019-10-13 21:32:42,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4b645cc/e8169bf395184404922c050b0c987beb/FLAGef4093cf3 [2019-10-13 21:32:42,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc4b645cc/e8169bf395184404922c050b0c987beb [2019-10-13 21:32:42,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:42,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:42,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:42,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:42,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:42,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2022d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42, skipping insertion in model container [2019-10-13 21:32:42,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,451 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:42,477 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:42,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:42,691 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:42,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:42,730 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:42,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42 WrapperNode [2019-10-13 21:32:42,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:42,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:42,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:42,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:42,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (1/1) ... [2019-10-13 21:32:42,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:42,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:42,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:42,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:42,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (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-13 21:32:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:42,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:42,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:42,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:42,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:43,350 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:43,350 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:32:43,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:43 BoogieIcfgContainer [2019-10-13 21:32:43,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:43,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:43,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:43,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:43,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:42" (1/3) ... [2019-10-13 21:32:43,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17373d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:43, skipping insertion in model container [2019-10-13 21:32:43,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:42" (2/3) ... [2019-10-13 21:32:43,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17373d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:43, skipping insertion in model container [2019-10-13 21:32:43,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:43" (3/3) ... [2019-10-13 21:32:43,359 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_bubblesort_ground-1.i [2019-10-13 21:32:43,367 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:43,375 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:43,387 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:43,409 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:43,409 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:43,409 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:43,409 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:43,410 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:43,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:43,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:43,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 21:32:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:43,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,430 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,432 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash -573825775, now seen corresponding path program 1 times [2019-10-13 21:32:43,444 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360764138] [2019-10-13 21:32:43,444 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,609 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-13 21:32:43,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360764138] [2019-10-13 21:32:43,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:43,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:43,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074488518] [2019-10-13 21:32:43,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:43,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,633 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-13 21:32:43,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,669 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-13 21:32:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,680 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:43,680 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 21:32:43,684 INFO L600 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-13 21:32:43,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 21:32:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 21:32:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 21:32:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-13 21:32:43,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2019-10-13 21:32:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,724 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-13 21:32:43,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-13 21:32:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:43,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,726 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1140036509, now seen corresponding path program 1 times [2019-10-13 21:32:43,727 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961057633] [2019-10-13 21:32:43,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,773 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-13 21:32:43,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961057633] [2019-10-13 21:32:43,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:43,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:43,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478176943] [2019-10-13 21:32:43,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:43,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,777 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2019-10-13 21:32:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,803 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-10-13 21:32:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,805 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:32:43,805 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:43,806 INFO L600 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-13 21:32:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:32:43,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-13 21:32:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,813 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:32:43,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:32:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:32:43,814 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,814 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1123124524, now seen corresponding path program 1 times [2019-10-13 21:32:43,815 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251033266] [2019-10-13 21:32:43,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,854 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-13 21:32:43,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251033266] [2019-10-13 21:32:43,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:43,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:43,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869451572] [2019-10-13 21:32:43,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:43,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:43,857 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 21:32:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,870 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2019-10-13 21:32:43,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:43,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-13 21:32:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,872 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:43,872 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:32:43,873 INFO L600 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-13 21:32:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:32:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 21:32:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:32:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:32:43,878 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2019-10-13 21:32:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,879 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:32:43,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:32:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:32:43,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,880 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash -685002894, now seen corresponding path program 1 times [2019-10-13 21:32:43,881 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514926285] [2019-10-13 21:32:43,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,965 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-13 21:32:43,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514926285] [2019-10-13 21:32:43,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418285400] [2019-10-13 21:32:43,966 INFO L94 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-13 21:32:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:44,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:44,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:44,073 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-13 21:32:44,073 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:44,119 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-13 21:32:44,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1646292104] [2019-10-13 21:32:44,172 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:44,173 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:44,188 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:44,202 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:44,202 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:44,382 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:44,939 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:44,964 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:44,974 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:44,974 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:44,975 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(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-13 21:32:44,976 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_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-13 21:32:44,977 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-13 21:32:44,977 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-13 21:32:44,977 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-13 21:32:44,978 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-13 21:32:44,978 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:44,978 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-13 21:32:44,979 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-13 21:32:44,979 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-13 21:32:44,979 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-13 21:32:44,979 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:44,980 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_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-13 21:32:44,980 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(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-13 21:32:44,980 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:45,530 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:45,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 13] total 19 [2019-10-13 21:32:45,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093197107] [2019-10-13 21:32:45,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 21:32:45,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 21:32:45,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:32:45,537 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 19 states. [2019-10-13 21:32:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:46,454 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-13 21:32:46,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 21:32:46,454 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2019-10-13 21:32:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:46,457 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:32:46,457 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 21:32:46,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 21:32:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 21:32:46,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-10-13 21:32:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 21:32:46,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-13 21:32:46,473 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2019-10-13 21:32:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:46,473 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-13 21:32:46,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 21:32:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-13 21:32:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:32:46,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:46,475 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:46,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:46,688 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:46,688 INFO L82 PathProgramCache]: Analyzing trace with hash -143319426, now seen corresponding path program 2 times [2019-10-13 21:32:46,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:46,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107402217] [2019-10-13 21:32:46,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:46,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107402217] [2019-10-13 21:32:46,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461438519] [2019-10-13 21:32:46,762 INFO L92 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-13 21:32:46,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:46,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:46,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:46,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,841 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:46,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [58002779] [2019-10-13 21:32:46,903 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:46,903 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:46,903 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:46,904 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:46,904 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:46,935 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:47,240 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:47,258 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:47,263 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:47,264 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:47,266 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-13 21:32:47,266 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-13 21:32:47,267 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-13 21:32:47,267 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-13 21:32:47,267 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-13 21:32:47,267 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-13 21:32:47,267 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:47,268 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-13 21:32:47,277 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-13 21:32:47,278 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-13 21:32:47,278 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-13 21:32:47,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:47,280 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-13 21:32:47,282 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-13 21:32:47,283 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:47,731 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:47,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 13] total 25 [2019-10-13 21:32:47,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032839469] [2019-10-13 21:32:47,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 21:32:47,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 21:32:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-10-13 21:32:47,734 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 25 states. [2019-10-13 21:32:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:48,659 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2019-10-13 21:32:48,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 21:32:48,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 20 [2019-10-13 21:32:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:48,662 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:32:48,662 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 21:32:48,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 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-13 21:32:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 21:32:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2019-10-13 21:32:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:32:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 21:32:48,678 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2019-10-13 21:32:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:48,679 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 21:32:48,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 21:32:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 21:32:48,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 21:32:48,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:48,681 INFO L380 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:48,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:48,895 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:48,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:48,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1928611330, now seen corresponding path program 3 times [2019-10-13 21:32:48,896 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:48,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022521232] [2019-10-13 21:32:48,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022521232] [2019-10-13 21:32:49,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622156986] [2019-10-13 21:32:49,099 INFO L92 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-13 21:32:49,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:49,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:49,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:49,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,213 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:49,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486562380] [2019-10-13 21:32:49,439 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:49,439 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:49,440 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:49,440 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:49,440 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:49,482 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:49,722 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:49,734 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:49,737 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:49,737 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:49,738 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-13 21:32:49,738 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-13 21:32:49,738 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-13 21:32:49,738 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-13 21:32:49,738 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-13 21:32:49,740 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-13 21:32:49,740 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:49,740 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-13 21:32:49,741 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,742 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-13 21:32:49,742 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-13 21:32:49,742 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:49,743 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-13 21:32:49,743 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-13 21:32:49,743 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:50,209 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:50,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13] total 37 [2019-10-13 21:32:50,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58625110] [2019-10-13 21:32:50,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 21:32:50,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 21:32:50,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:32:50,213 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 37 states. [2019-10-13 21:32:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,674 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2019-10-13 21:32:51,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 21:32:51,675 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 26 [2019-10-13 21:32:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,676 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:32:51,676 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 21:32:51,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 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-13 21:32:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 21:32:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2019-10-13 21:32:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 21:32:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 21:32:51,689 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 26 [2019-10-13 21:32:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,689 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 21:32:51,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 21:32:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 21:32:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:32:51,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,691 INFO L380 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:51,901 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1848185086, now seen corresponding path program 4 times [2019-10-13 21:32:51,902 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814041236] [2019-10-13 21:32:51,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,903 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:52,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814041236] [2019-10-13 21:32:52,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033719576] [2019-10-13 21:32:52,337 INFO L92 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-13 21:32:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:32:52,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:52,452 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:53,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399250018] [2019-10-13 21:32:53,136 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:53,137 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:53,137 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:53,138 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:53,138 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:53,159 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:53,363 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:53,370 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:53,373 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:53,374 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:53,374 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:53,374 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_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:53,374 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-13 21:32:53,375 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-13 21:32:53,375 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-13 21:32:53,375 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-13 21:32:53,375 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:53,375 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-13 21:32:53,376 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-13 21:32:53,376 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-13 21:32:53,376 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-13 21:32:53,377 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:53,377 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_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:53,377 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_10 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 (not (<= (select (select |#memory_int| v_prenex_9) v_prenex_10) (select (select |#memory_int| v_prenex_9) (+ v_prenex_10 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:32:53,377 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:53,921 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:53,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 13] total 61 [2019-10-13 21:32:53,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139995029] [2019-10-13 21:32:53,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-13 21:32:53,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-13 21:32:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1215, Invalid=2445, Unknown=0, NotChecked=0, Total=3660 [2019-10-13 21:32:53,926 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 61 states. [2019-10-13 21:32:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:56,854 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2019-10-13 21:32:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-13 21:32:56,854 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 38 [2019-10-13 21:32:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:56,855 INFO L225 Difference]: With dead ends: 95 [2019-10-13 21:32:56,855 INFO L226 Difference]: Without dead ends: 79 [2019-10-13 21:32:56,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3227 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3554, Invalid=10018, Unknown=0, NotChecked=0, Total=13572 [2019-10-13 21:32:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-13 21:32:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2019-10-13 21:32:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 21:32:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 21:32:56,870 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 38 [2019-10-13 21:32:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:56,871 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 21:32:56,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-13 21:32:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 21:32:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:32:56,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:56,873 INFO L380 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:57,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:57,077 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:57,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:57,078 INFO L82 PathProgramCache]: Analyzing trace with hash 390348542, now seen corresponding path program 5 times [2019-10-13 21:32:57,078 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:57,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645406894] [2019-10-13 21:32:57,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:57,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:57,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:58,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645406894] [2019-10-13 21:32:58,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062111800] [2019-10-13 21:32:58,116 INFO L92 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-13 21:32:58,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:58,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:58,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:58,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:32:58,254 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:32:58,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [608607039] [2019-10-13 21:32:58,309 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:32:58,309 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:58,309 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:58,310 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:58,310 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:58,329 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:58,519 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:58,529 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:58,532 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:58,532 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:58,532 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_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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-13 21:32:58,532 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:58,535 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-13 21:32:58,536 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-13 21:32:58,536 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-13 21:32:58,536 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-13 21:32:58,536 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:32:58,536 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-13 21:32:58,536 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-13 21:32:58,537 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-13 21:32:58,537 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-13 21:32:58,537 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:58,537 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_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (v_prenex_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:58,537 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_12 Int) (v_prenex_11 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (not (<= (select (select |#memory_int| v_prenex_11) v_prenex_12) (select (select |#memory_int| v_prenex_11) (+ v_prenex_12 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-13 21:32:58,538 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:32:59,275 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:59,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 4, 4, 13] total 65 [2019-10-13 21:32:59,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026546341] [2019-10-13 21:32:59,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-13 21:32:59,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:59,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-13 21:32:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=2931, Unknown=0, NotChecked=0, Total=4160 [2019-10-13 21:32:59,279 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 65 states. [2019-10-13 21:33:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:03,260 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-10-13 21:33:03,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-13 21:33:03,261 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 62 [2019-10-13 21:33:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:03,262 INFO L225 Difference]: With dead ends: 99 [2019-10-13 21:33:03,262 INFO L226 Difference]: Without dead ends: 83 [2019-10-13 21:33:03,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2962 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3699, Invalid=12051, Unknown=0, NotChecked=0, Total=15750 [2019-10-13 21:33:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-13 21:33:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2019-10-13 21:33:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 21:33:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2019-10-13 21:33:03,290 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 62 [2019-10-13 21:33:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:03,292 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2019-10-13 21:33:03,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-13 21:33:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2019-10-13 21:33:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:33:03,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:03,298 INFO L380 BasicCegarLoop]: trace histogram [47, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:03,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:03,504 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 973546540, now seen corresponding path program 6 times [2019-10-13 21:33:03,505 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:03,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510909585] [2019-10-13 21:33:03,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:03,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:04,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510909585] [2019-10-13 21:33:04,490 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22256468] [2019-10-13 21:33:04,490 INFO L92 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-13 21:33:04,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:04,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:04,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:33:04,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:04,677 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:07,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462170158] [2019-10-13 21:33:07,253 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-13 21:33:07,253 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:07,254 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:07,254 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:07,254 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:07,275 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:07,436 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:07,441 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:07,443 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:07,443 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:07,444 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 205#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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-13 21:33:07,444 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 210#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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_~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-13 21:33:07,444 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-13 21:33:07,444 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-13 21:33:07,444 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-13 21:33:07,445 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-13 21:33:07,445 INFO L193 IcfgInterpreter]: Reachable states at location L8-3 satisfy 68#true [2019-10-13 21:33:07,445 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-13 21:33:07,445 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-13 21:33:07,445 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-13 21:33:07,445 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-13 21:33:07,446 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:07,446 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 215#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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_~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-13 21:33:07,446 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 200#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (v_prenex_14 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_14) v_prenex_13) (select (select |#memory_int| v_prenex_14) (+ v_prenex_13 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-13 21:33:07,446 INFO L193 IcfgInterpreter]: Reachable states at location L31 satisfy 191#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (<= 0 main_~swapped~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= 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) (<= 100000 main_~i~0) (<= main_~y~0 1)) [2019-10-13 21:33:08,120 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:08,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50, 13] total 111 [2019-10-13 21:33:08,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073746231] [2019-10-13 21:33:08,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-13 21:33:08,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-13 21:33:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4890, Invalid=7320, Unknown=0, NotChecked=0, Total=12210 [2019-10-13 21:33:08,128 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 111 states. [2019-10-13 21:33:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:15,544 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2019-10-13 21:33:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-10-13 21:33:15,544 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 66 [2019-10-13 21:33:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:15,545 INFO L225 Difference]: With dead ends: 151 [2019-10-13 21:33:15,546 INFO L226 Difference]: Without dead ends: 132 [2019-10-13 21:33:15,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9652 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=14479, Invalid=32393, Unknown=0, NotChecked=0, Total=46872 [2019-10-13 21:33:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-13 21:33:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2019-10-13 21:33:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 21:33:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2019-10-13 21:33:15,564 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 66 [2019-10-13 21:33:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:15,565 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2019-10-13 21:33:15,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-13 21:33:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2019-10-13 21:33:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:33:15,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:15,567 INFO L380 BasicCegarLoop]: trace histogram [96, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:15,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:15,770 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 734515488, now seen corresponding path program 7 times [2019-10-13 21:33:15,771 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:15,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911318299] [2019-10-13 21:33:15,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:15,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:19,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911318299] [2019-10-13 21:33:19,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181985567] [2019-10-13 21:33:19,412 INFO L92 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-13 21:33:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:19,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-13 21:33:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4667 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 21:33:19,663 INFO L321 TraceCheckSpWp]: Computing backward predicates...