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/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:03:29,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:03:29,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:03:29,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:03:29,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:03:29,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:03:29,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:03:29,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:03:29,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:03:29,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:03:29,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:03:29,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:03:29,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:03:29,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:03:29,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:03:29,717 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:03:29,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:03:29,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:03:29,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:03:29,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:03:29,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:03:29,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:03:29,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:03:29,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:03:29,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:03:29,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:03:29,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:03:29,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:03:29,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:03:29,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:03:29,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:03:29,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:03:29,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:03:29,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:03:29,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:03:29,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:03:29,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:03:29,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:03:29,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:03:29,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:03:29,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:03:29,739 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-15 03:03:29,755 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:03:29,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:03:29,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:03:29,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:03:29,757 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:03:29,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:03:29,758 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:03:29,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:03:29,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:03:29,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:03:29,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:03:29,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:03:29,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:03:29,759 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:03:29,759 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:03:29,759 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:03:29,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:03:29,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:03:29,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:03:29,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:03:29,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:03:29,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:03:29,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:03:29,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:03:29,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:03:29,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:03:29,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:03:29,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:03:29,762 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-15 03:03:30,099 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:03:30,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:03:30,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:03:30,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:03:30,131 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:03:30,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2019-10-15 03:03:30,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0890e1068/70a7425e874644c495455628088fdb7d/FLAGbebf81956 [2019-10-15 03:03:30,717 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:03:30,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2019-10-15 03:03:30,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0890e1068/70a7425e874644c495455628088fdb7d/FLAGbebf81956 [2019-10-15 03:03:31,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0890e1068/70a7425e874644c495455628088fdb7d [2019-10-15 03:03:31,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:03:31,149 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:03:31,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:31,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:03:31,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:03:31,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19511e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31, skipping insertion in model container [2019-10-15 03:03:31,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,169 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:03:31,188 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:03:31,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:31,410 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:03:31,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:03:31,558 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:03:31,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31 WrapperNode [2019-10-15 03:03:31,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:03:31,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:03:31,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:03:31,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:03:31,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (1/1) ... [2019-10-15 03:03:31,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:03:31,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:03:31,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:03:31,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:03:31,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (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-15 03:03:31,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:03:31,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:03:31,674 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 03:03:31,674 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2019-10-15 03:03:31,674 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:03:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:03:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 03:03:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2019-10-15 03:03:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 03:03:31,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 03:03:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:03:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 03:03:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 03:03:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:03:31,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 03:03:31,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:03:32,126 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:03:32,126 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 03:03:32,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:32 BoogieIcfgContainer [2019-10-15 03:03:32,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:03:32,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:03:32,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:03:32,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:03:32,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:03:31" (1/3) ... [2019-10-15 03:03:32,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8545447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:32, skipping insertion in model container [2019-10-15 03:03:32,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:03:31" (2/3) ... [2019-10-15 03:03:32,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8545447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:03:32, skipping insertion in model container [2019-10-15 03:03:32,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:03:32" (3/3) ... [2019-10-15 03:03:32,137 INFO L109 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2019-10-15 03:03:32,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:03:32,152 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:03:32,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:03:32,188 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:03:32,189 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:03:32,189 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:03:32,189 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:03:32,189 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:03:32,189 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:03:32,190 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:03:32,190 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:03:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-10-15 03:03:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:03:32,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:32,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:32,218 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1887145795, now seen corresponding path program 1 times [2019-10-15 03:03:32,231 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:32,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546759220] [2019-10-15 03:03:32,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,232 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:32,454 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-15 03:03:32,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546759220] [2019-10-15 03:03:32,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:03:32,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:03:32,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481082237] [2019-10-15 03:03:32,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:03:32,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:32,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:03:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:03:32,476 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-10-15 03:03:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:32,518 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2019-10-15 03:03:32,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:03:32,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-15 03:03:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:32,529 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:03:32,529 INFO L226 Difference]: Without dead ends: 22 [2019-10-15 03:03:32,533 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-15 03:03:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-15 03:03:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-15 03:03:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-15 03:03:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-10-15 03:03:32,572 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 16 [2019-10-15 03:03:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:32,573 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-10-15 03:03:32,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:03:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-10-15 03:03:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:03:32,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:32,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:32,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -538258500, now seen corresponding path program 1 times [2019-10-15 03:03:32,576 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:32,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551520385] [2019-10-15 03:03:32,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:32,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:32,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551520385] [2019-10-15 03:03:32,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528055461] [2019-10-15 03:03:32,660 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-15 03:03:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:32,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:03:32,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:32,754 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:32,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967722653] [2019-10-15 03:03:32,833 INFO L162 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-10-15 03:03:32,833 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:32,842 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:32,857 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:32,858 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:33,251 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:33,784 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:33,807 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:33,823 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:33,987 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-15 03:03:34,131 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-15 03:03:34,356 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:34,548 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 20 [2019-10-15 03:03:34,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 03:03:34,758 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 4, 4] total 14 [2019-10-15 03:03:34,758 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231832199] [2019-10-15 03:03:34,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:03:34,763 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:03:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:03:34,765 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 10 states. [2019-10-15 03:03:34,932 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:35,183 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-15 03:03:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:35,500 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-10-15 03:03:35,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:03:35,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-15 03:03:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:35,502 INFO L225 Difference]: With dead ends: 44 [2019-10-15 03:03:35,502 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:03:35,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:03:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:03:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2019-10-15 03:03:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-15 03:03:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-15 03:03:35,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 17 [2019-10-15 03:03:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:35,512 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-15 03:03:35,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:03:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-15 03:03:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:03:35,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:35,513 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:35,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:35,728 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1423330971, now seen corresponding path program 1 times [2019-10-15 03:03:35,729 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:35,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43142733] [2019-10-15 03:03:35,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:35,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:35,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:03:35,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43142733] [2019-10-15 03:03:35,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414198430] [2019-10-15 03:03:35,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-15 03:03:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:35,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:03:35,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:03:35,864 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:35,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 03:03:35,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [476362147] [2019-10-15 03:03:35,890 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:35,890 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:35,891 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:35,891 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:35,892 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:35,993 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:36,431 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:36,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:36,559 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:36,749 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-15 03:03:37,055 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-15 03:03:37,203 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:37,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 03:03:37,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 15 [2019-10-15 03:03:37,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742120609] [2019-10-15 03:03:37,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:03:37,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:37,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:03:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:03:37,631 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 11 states. [2019-10-15 03:03:37,811 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:38,207 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-15 03:03:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:38,663 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-10-15 03:03:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:03:38,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-10-15 03:03:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:38,665 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:03:38,666 INFO L226 Difference]: Without dead ends: 34 [2019-10-15 03:03:38,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:03:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-15 03:03:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2019-10-15 03:03:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-15 03:03:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-10-15 03:03:38,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 19 [2019-10-15 03:03:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:38,683 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-10-15 03:03:38,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:03:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-10-15 03:03:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:03:38,684 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:38,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:38,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:38,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1397620879, now seen corresponding path program 1 times [2019-10-15 03:03:38,892 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:38,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167180892] [2019-10-15 03:03:38,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:38,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:38,969 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-15 03:03:38,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167180892] [2019-10-15 03:03:38,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27823852] [2019-10-15 03:03:38,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-15 03:03:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:39,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 03:03:39,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:39,054 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-15 03:03:39,054 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:39,109 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-15 03:03:39,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [508269776] [2019-10-15 03:03:39,115 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:39,116 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:39,117 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:39,118 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:39,120 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:39,223 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:39,841 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-15 03:03:39,862 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:40,158 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:40,172 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:40,553 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-10-15 03:03:40,687 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:41,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:41,300 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 14] total 19 [2019-10-15 03:03:41,300 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729825481] [2019-10-15 03:03:41,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-15 03:03:41,301 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-15 03:03:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:03:41,302 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 19 states. [2019-10-15 03:03:41,452 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:41,791 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-15 03:03:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:42,839 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-10-15 03:03:42,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 03:03:42,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2019-10-15 03:03:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:42,844 INFO L225 Difference]: With dead ends: 63 [2019-10-15 03:03:42,844 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 03:03:42,845 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:03:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 03:03:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2019-10-15 03:03:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:03:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-10-15 03:03:42,853 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-10-15 03:03:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:42,854 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-10-15 03:03:42,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-15 03:03:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-10-15 03:03:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 03:03:42,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:42,855 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:43,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:43,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:43,061 INFO L82 PathProgramCache]: Analyzing trace with hash -153598616, now seen corresponding path program 2 times [2019-10-15 03:03:43,061 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:43,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024063810] [2019-10-15 03:03:43,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:43,062 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:43,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:03:43,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024063810] [2019-10-15 03:03:43,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957347318] [2019-10-15 03:03:43,353 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 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-15 03:03:43,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 03:03:43,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:43,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 03:03:43,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:43,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 03:03:43,487 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-15 03:03:43,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1673945947] [2019-10-15 03:03:43,588 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:43,588 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:43,589 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:43,589 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:43,589 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:43,689 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:44,072 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-15 03:03:44,083 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:44,319 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:44,327 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:44,838 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:45,463 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:45,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6, 14] total 30 [2019-10-15 03:03:45,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082818194] [2019-10-15 03:03:45,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-15 03:03:45,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:45,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-15 03:03:45,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2019-10-15 03:03:45,467 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 30 states. [2019-10-15 03:03:45,620 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:45,892 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-10-15 03:03:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:47,621 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-15 03:03:47,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-15 03:03:47,626 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2019-10-15 03:03:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:47,629 INFO L225 Difference]: With dead ends: 75 [2019-10-15 03:03:47,629 INFO L226 Difference]: Without dead ends: 58 [2019-10-15 03:03:47,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=346, Invalid=2204, Unknown=0, NotChecked=0, Total=2550 [2019-10-15 03:03:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-15 03:03:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-10-15 03:03:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-15 03:03:47,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-10-15 03:03:47,644 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 23 [2019-10-15 03:03:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:47,644 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-10-15 03:03:47,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-15 03:03:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-10-15 03:03:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:03:47,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:47,646 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:47,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:47,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1408529940, now seen corresponding path program 3 times [2019-10-15 03:03:47,855 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:47,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899706219] [2019-10-15 03:03:47,855 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:47,856 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:47,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-15 03:03:47,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899706219] [2019-10-15 03:03:47,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155246834] [2019-10-15 03:03:47,986 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 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-15 03:03:48,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:03:48,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:48,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:03:48,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:03:48,072 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-15 03:03:48,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295096906] [2019-10-15 03:03:48,101 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:48,101 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:48,102 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:48,102 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:48,102 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:48,158 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:48,615 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-15 03:03:48,626 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:48,856 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:48,865 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:49,111 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-15 03:03:49,395 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:49,926 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:49,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6, 14] total 22 [2019-10-15 03:03:49,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360323175] [2019-10-15 03:03:49,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 03:03:49,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 03:03:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-15 03:03:49,929 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 22 states. [2019-10-15 03:03:50,093 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:50,418 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-15 03:03:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:51,688 INFO L93 Difference]: Finished difference Result 80 states and 97 transitions. [2019-10-15 03:03:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-15 03:03:51,689 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-10-15 03:03:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:51,690 INFO L225 Difference]: With dead ends: 80 [2019-10-15 03:03:51,690 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:03:51,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 03:03:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:03:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2019-10-15 03:03:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-15 03:03:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2019-10-15 03:03:51,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 30 [2019-10-15 03:03:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:51,703 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2019-10-15 03:03:51,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 03:03:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2019-10-15 03:03:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:03:51,704 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:51,704 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:51,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:51,910 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:51,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1822237808, now seen corresponding path program 4 times [2019-10-15 03:03:51,914 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:51,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120899830] [2019-10-15 03:03:51,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:51,914 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:51,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 03:03:52,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120899830] [2019-10-15 03:03:52,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199375178] [2019-10-15 03:03:52,044 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 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-15 03:03:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:52,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 03:03:52,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 03:03:52,216 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:52,349 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 03:03:52,349 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [271795883] [2019-10-15 03:03:52,351 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:52,351 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:52,351 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:52,351 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:52,352 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:52,402 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:52,853 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-15 03:03:52,867 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:53,072 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:53,080 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:53,606 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-10-15 03:03:54,230 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:54,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 14] total 32 [2019-10-15 03:03:54,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331698043] [2019-10-15 03:03:54,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-15 03:03:54,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:54,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-15 03:03:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=864, Unknown=0, NotChecked=0, Total=992 [2019-10-15 03:03:54,233 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 32 states. [2019-10-15 03:03:54,409 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-10-15 03:03:54,703 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-15 03:03:56,744 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-15 03:03:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:03:57,086 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2019-10-15 03:03:57,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-15 03:03:57,086 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2019-10-15 03:03:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:03:57,088 INFO L225 Difference]: With dead ends: 90 [2019-10-15 03:03:57,089 INFO L226 Difference]: Without dead ends: 66 [2019-10-15 03:03:57,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=459, Invalid=2847, Unknown=0, NotChecked=0, Total=3306 [2019-10-15 03:03:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-15 03:03:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2019-10-15 03:03:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-15 03:03:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-10-15 03:03:57,104 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 34 [2019-10-15 03:03:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:03:57,105 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-10-15 03:03:57,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-15 03:03:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-10-15 03:03:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:03:57,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:03:57,107 INFO L380 BasicCegarLoop]: trace histogram [8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:03:57,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:03:57,312 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:03:57,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:03:57,313 INFO L82 PathProgramCache]: Analyzing trace with hash 306482970, now seen corresponding path program 5 times [2019-10-15 03:03:57,314 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:03:57,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810203572] [2019-10-15 03:03:57,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:57,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:03:57,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:03:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:03:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 44 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-15 03:03:57,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810203572] [2019-10-15 03:03:57,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321765309] [2019-10-15 03:03:57,542 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 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-15 03:03:57,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-15 03:03:57,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:03:57,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 03:03:57,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:03:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 03:03:57,805 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:03:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 03:03:58,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2137531892] [2019-10-15 03:03:58,042 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 03:03:58,042 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:03:58,043 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:03:58,047 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:03:58,047 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:03:58,097 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 60 for LOIs [2019-10-15 03:03:58,426 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 36 for LOIs [2019-10-15 03:03:58,432 INFO L199 IcfgInterpreter]: Interpreting procedure SelectionSort with input of size 22 for LOIs [2019-10-15 03:03:58,604 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-15 03:03:58,612 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:03:58,852 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-15 03:03:59,740 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 03:03:59,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9, 14] total 35 [2019-10-15 03:03:59,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915255579] [2019-10-15 03:03:59,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-15 03:03:59,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:03:59,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-15 03:03:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2019-10-15 03:03:59,744 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 35 states. [2019-10-15 03:04:00,217 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-10-15 03:04:03,204 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-10-15 03:04:03,584 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-10-15 03:04:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:04:03,907 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2019-10-15 03:04:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-15 03:04:03,908 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 37 [2019-10-15 03:04:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:04:03,910 INFO L225 Difference]: With dead ends: 108 [2019-10-15 03:04:03,910 INFO L226 Difference]: Without dead ends: 87 [2019-10-15 03:04:03,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=998, Invalid=4702, Unknown=0, NotChecked=0, Total=5700 [2019-10-15 03:04:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-15 03:04:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2019-10-15 03:04:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-15 03:04:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-15 03:04:03,925 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 37 [2019-10-15 03:04:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:04:03,925 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-15 03:04:03,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-15 03:04:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-15 03:04:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:04:03,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:04:03,927 INFO L380 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:04:04,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:04:04,131 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:04:04,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:04:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1774109467, now seen corresponding path program 6 times [2019-10-15 03:04:04,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:04:04,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090994784] [2019-10-15 03:04:04,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:04:04,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:04:04,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:04:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:04:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 6 proven. 64 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-15 03:04:04,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090994784] [2019-10-15 03:04:04,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311730342] [2019-10-15 03:04:04,696 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:04:04,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 03:04:04,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 03:04:04,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-15 03:04:04,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:04:06,716 WARN L860 $PredicateComparison]: unable to prove that (exists ((SelectionSort_~rh~0 Int) (v_SelectionSort_~lh~0_132 Int) (SelectionSort_~temp~0 Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (let ((.cse1 (+ (* SelectionSort_~rh~0 4) |c_~#array~0.offset|))) (store (let ((.cse0 (select |c_old(#memory_int)| |c_~#array~0.base|))) (store .cse0 (+ |c_~#array~0.offset| (* v_SelectionSort_~lh~0_132 4)) (select .cse0 .cse1))) .cse1 SelectionSort_~temp~0))) |c_#memory_int|)) is different from true [2019-10-15 03:04:08,357 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_SelectionSort_~lh~0_133 Int) (SelectionSort_~rh~0 Int) (v_SelectionSort_~lh~0_132 Int) (SelectionSort_~temp~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (let ((.cse1 (+ (* SelectionSort_~rh~0 4) |c_~#array~0.offset|))) (store (let ((.cse0 (let ((.cse3 (+ (* v_prenex_6 4) |c_~#array~0.offset|))) (store (let ((.cse2 (select |c_old(#memory_int)| |c_~#array~0.base|))) (store .cse2 (+ |c_~#array~0.offset| (* v_SelectionSort_~lh~0_132 4)) (select .cse2 .cse3))) .cse3 v_prenex_7)))) (store .cse0 (+ (* v_SelectionSort_~lh~0_133 4) |c_~#array~0.offset|) (select .cse0 .cse1))) .cse1 SelectionSort_~temp~0))))) is different from true [2019-10-15 03:04:10,368 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_SelectionSort_~lh~0_134 Int) (v_prenex_7 Int) (v_SelectionSort_~lh~0_133 Int) (SelectionSort_~rh~0 Int) (v_SelectionSort_~lh~0_132 Int) (v_prenex_8 Int) (v_prenex_9 Int) (SelectionSort_~temp~0 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (let ((.cse1 (+ (* SelectionSort_~rh~0 4) |c_~#array~0.offset|))) (store (let ((.cse0 (let ((.cse3 (+ |c_~#array~0.offset| (* v_prenex_8 4)))) (store (let ((.cse2 (let ((.cse5 (+ (* v_prenex_6 4) |c_~#array~0.offset|))) (store (let ((.cse4 (select |c_old(#memory_int)| |c_~#array~0.base|))) (store .cse4 (+ |c_~#array~0.offset| (* v_SelectionSort_~lh~0_132 4)) (select .cse4 .cse5))) .cse5 v_prenex_7)))) (store .cse2 (+ (* v_SelectionSort_~lh~0_133 4) |c_~#array~0.offset|) (select .cse2 .cse3))) .cse3 v_prenex_9)))) (store .cse0 (+ (* v_SelectionSort_~lh~0_134 4) |c_~#array~0.offset|) (select .cse0 .cse1))) .cse1 SelectionSort_~temp~0))))) is different from true [2019-10-15 03:04:12,396 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 Int) (v_SelectionSort_~lh~0_134 Int) (v_prenex_7 Int) (v_SelectionSort_~lh~0_133 Int) (v_SelectionSort_~lh~0_135 Int) (v_prenex_11 Int) (SelectionSort_~rh~0 Int) (v_prenex_10 Int) (v_SelectionSort_~lh~0_132 Int) (v_prenex_8 Int) (v_prenex_9 Int) (SelectionSort_~temp~0 Int)) (= (store |c_old(#memory_int)| |c_~#array~0.base| (let ((.cse1 (+ (* SelectionSort_~rh~0 4) |c_~#array~0.offset|))) (store (let ((.cse0 (let ((.cse3 (+ |c_~#array~0.offset| (* v_prenex_10 4)))) (store (let ((.cse2 (let ((.cse5 (+ |c_~#array~0.offset| (* v_prenex_8 4)))) (store (let ((.cse4 (let ((.cse7 (+ (* v_prenex_6 4) |c_~#array~0.offset|))) (store (let ((.cse6 (select |c_old(#memory_int)| |c_~#array~0.base|))) (store .cse6 (+ |c_~#array~0.offset| (* v_SelectionSort_~lh~0_132 4)) (select .cse6 .cse7))) .cse7 v_prenex_7)))) (store .cse4 (+ (* v_SelectionSort_~lh~0_133 4) |c_~#array~0.offset|) (select .cse4 .cse5))) .cse5 v_prenex_9)))) (store .cse2 (+ (* v_SelectionSort_~lh~0_134 4) |c_~#array~0.offset|) (select .cse2 .cse3))) .cse3 v_prenex_11)))) (store .cse0 (+ (* v_SelectionSort_~lh~0_135 4) |c_~#array~0.offset|) (select .cse0 .cse1))) .cse1 SelectionSort_~temp~0))) |c_#memory_int|)) is different from true [2019-10-15 03:04:14,423 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_12 Int) (v_prenex_11 Int) (SelectionSort_~rh~0 Int) (v_prenex_13 Int) (v_prenex_10 Int) (v_SelectionSort_~lh~0_132 Int) (v_prenex_8 Int) (v_prenex_9 Int) (SelectionSort_~temp~0 Int) (v_prenex_6 Int) (v_SelectionSort_~lh~0_134 Int) (v_prenex_7 Int) (v_SelectionSort_~lh~0_133 Int) (v_SelectionSort_~lh~0_136 Int) (v_SelectionSort_~lh~0_135 Int)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_~#array~0.base| (let ((.cse1 (+ (* SelectionSort_~rh~0 4) |c_~#array~0.offset|))) (store (let ((.cse0 (let ((.cse3 (+ (* v_prenex_12 4) |c_~#array~0.offset|))) (store (let ((.cse2 (let ((.cse5 (+ |c_~#array~0.offset| (* v_prenex_10 4)))) (store (let ((.cse4 (let ((.cse7 (+ |c_~#array~0.offset| (* v_prenex_8 4)))) (store (let ((.cse6 (let ((.cse9 (+ (* v_prenex_6 4) |c_~#array~0.offset|))) (store (let ((.cse8 (select |c_old(#memory_int)| |c_~#array~0.base|))) (store .cse8 (+ |c_~#array~0.offset| (* v_SelectionSort_~lh~0_132 4)) (select .cse8 .cse9))) .cse9 v_prenex_7)))) (store .cse6 (+ (* v_SelectionSort_~lh~0_133 4) |c_~#array~0.offset|) (select .cse6 .cse7))) .cse7 v_prenex_9)))) (store .cse4 (+ (* v_SelectionSort_~lh~0_134 4) |c_~#array~0.offset|) (select .cse4 .cse5))) .cse5 v_prenex_11)))) (store .cse2 (+ (* v_SelectionSort_~lh~0_135 4) |c_~#array~0.offset|) (select .cse2 .cse3))) .cse3 v_prenex_13)))) (store .cse0 (+ (* v_SelectionSort_~lh~0_136 4) |c_~#array~0.offset|) (select .cse0 .cse1))) .cse1 SelectionSort_~temp~0))))) is different from true [2019-10-15 03:04:14,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:04:14,631 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.MultiDimensionalNestedStore.getInnermost(MultiDimensionalNestedStore.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-10-15 03:04:14,637 INFO L168 Benchmark]: Toolchain (without parser) took 43489.50 ms. Allocated memory was 135.8 MB in the beginning and 478.2 MB in the end (delta: 342.4 MB). Free memory was 100.5 MB in the beginning and 92.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 350.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,638 INFO L168 Benchmark]: CDTParser took 1.44 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.38 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 178.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,640 INFO L168 Benchmark]: Boogie Preprocessor took 48.74 ms. Allocated memory is still 199.2 MB. Free memory was 178.4 MB in the beginning and 176.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,641 INFO L168 Benchmark]: RCFGBuilder took 519.35 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 152.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,641 INFO L168 Benchmark]: TraceAbstraction took 42507.33 ms. Allocated memory was 199.2 MB in the beginning and 478.2 MB in the end (delta: 278.9 MB). Free memory was 152.3 MB in the beginning and 92.3 MB in the end (delta: 59.9 MB). Peak memory consumption was 338.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:04:14,643 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.44 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 407.38 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 178.4 MB in the end (delta: -78.4 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.74 ms. Allocated memory is still 199.2 MB. Free memory was 178.4 MB in the beginning and 176.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 519.35 ms. Allocated memory is still 199.2 MB. Free memory was 176.0 MB in the beginning and 152.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42507.33 ms. Allocated memory was 199.2 MB in the beginning and 478.2 MB in the end (delta: 278.9 MB). Free memory was 152.3 MB in the beginning and 92.3 MB in the end (delta: 59.9 MB). Peak memory consumption was 338.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.NullPointerException de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.NullPointerException: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...