java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:31:54,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:31:54,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:31:54,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:31:54,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:31:54,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:31:54,259 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:31:54,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:31:54,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:31:54,274 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:31:54,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:31:54,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:31:54,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:31:54,280 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:31:54,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:31:54,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:31:54,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:31:54,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:31:54,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:31:54,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:31:54,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:31:54,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:31:54,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:31:54,298 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:31:54,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:31:54,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:31:54,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:31:54,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:31:54,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:31:54,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:31:54,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:31:54,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:31:54,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:31:54,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:31:54,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:31:54,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:31:54,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:31:54,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:31:54,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:31:54,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:31:54,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:31:54,309 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 01:31:54,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:31:54,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:31:54,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:31:54,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:31:54,336 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:31:54,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:31:54,337 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:31:54,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:31:54,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:31:54,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:31:54,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:31:54,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:31:54,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:31:54,338 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:31:54,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:31:54,339 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:31:54,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:31:54,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:31:54,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:31:54,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:31:54,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:31:54,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:31:54,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:31:54,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:31:54,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:31:54,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:31:54,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:31:54,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:31:54,341 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 01:31:54,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:31:54,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:31:54,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:31:54,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:31:54,632 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:31:54,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-15 01:31:54,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefa91ea/8251e40d86324ae78c8ed8b5a89079a6/FLAG140b44e0a [2019-10-15 01:31:55,224 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:31:55,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-10-15 01:31:55,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefa91ea/8251e40d86324ae78c8ed8b5a89079a6/FLAG140b44e0a [2019-10-15 01:31:55,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefa91ea/8251e40d86324ae78c8ed8b5a89079a6 [2019-10-15 01:31:55,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:31:55,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:31:55,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:31:55,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:31:55,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:31:55,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc1e408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55, skipping insertion in model container [2019-10-15 01:31:55,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:31:55,599 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:31:55,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:31:55,810 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:31:55,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:31:55,947 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:31:55,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55 WrapperNode [2019-10-15 01:31:55,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:31:55,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:31:55,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:31:55,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:31:55,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (1/1) ... [2019-10-15 01:31:55,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:31:55,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:31:55,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:31:55,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:31:55,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (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 01:31:56,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:31:56,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:31:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:31:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:31:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:31:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:31:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:31:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:31:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:31:56,522 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:31:56,522 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-15 01:31:56,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:31:56 BoogieIcfgContainer [2019-10-15 01:31:56,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:31:56,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:31:56,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:31:56,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:31:56,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:31:55" (1/3) ... [2019-10-15 01:31:56,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86ca95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:31:56, skipping insertion in model container [2019-10-15 01:31:56,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:31:55" (2/3) ... [2019-10-15 01:31:56,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d86ca95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:31:56, skipping insertion in model container [2019-10-15 01:31:56,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:31:56" (3/3) ... [2019-10-15 01:31:56,534 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2019-10-15 01:31:56,542 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:31:56,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:31:56,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:31:56,581 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:31:56,581 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:31:56,582 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:31:56,582 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:31:56,582 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:31:56,582 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:31:56,582 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:31:56,583 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:31:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-15 01:31:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:31:56,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:56,605 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:56,607 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:56,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1973278226, now seen corresponding path program 1 times [2019-10-15 01:31:56,621 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:56,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179922549] [2019-10-15 01:31:56,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:56,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:56,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:56,789 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 01:31:56,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179922549] [2019-10-15 01:31:56,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:56,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:31:56,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236774251] [2019-10-15 01:31:56,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:31:56,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:56,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:31:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:31:56,819 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-10-15 01:31:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:56,870 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2019-10-15 01:31:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:31:56,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 01:31:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:56,882 INFO L225 Difference]: With dead ends: 51 [2019-10-15 01:31:56,882 INFO L226 Difference]: Without dead ends: 26 [2019-10-15 01:31:56,893 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 01:31:56,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-15 01:31:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-15 01:31:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-15 01:31:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-10-15 01:31:56,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 13 [2019-10-15 01:31:56,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:56,945 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-10-15 01:31:56,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:31:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-10-15 01:31:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 01:31:56,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:56,947 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:56,947 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:56,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1107315554, now seen corresponding path program 1 times [2019-10-15 01:31:56,948 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:56,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285248254] [2019-10-15 01:31:56,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:56,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:56,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:31:56,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285248254] [2019-10-15 01:31:56,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:56,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:31:56,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223962772] [2019-10-15 01:31:56,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:31:56,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:56,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:31:56,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:31:56,998 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2019-10-15 01:31:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:57,069 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-15 01:31:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:31:57,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-15 01:31:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:57,072 INFO L225 Difference]: With dead ends: 45 [2019-10-15 01:31:57,072 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 01:31:57,073 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 01:31:57,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 01:31:57,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-15 01:31:57,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 01:31:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-15 01:31:57,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 14 [2019-10-15 01:31:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:57,084 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-15 01:31:57,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:31:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-15 01:31:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:31:57,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:57,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:57,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1470921508, now seen corresponding path program 1 times [2019-10-15 01:31:57,086 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:57,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091254746] [2019-10-15 01:31:57,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:31:57,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091254746] [2019-10-15 01:31:57,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:57,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:31:57,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650125783] [2019-10-15 01:31:57,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:31:57,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:57,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:31:57,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:31:57,182 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2019-10-15 01:31:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:57,388 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-10-15 01:31:57,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:31:57,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 01:31:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:57,390 INFO L225 Difference]: With dead ends: 71 [2019-10-15 01:31:57,391 INFO L226 Difference]: Without dead ends: 52 [2019-10-15 01:31:57,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:31:57,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-15 01:31:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-10-15 01:31:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:31:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-10-15 01:31:57,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 15 [2019-10-15 01:31:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:57,402 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-10-15 01:31:57,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:31:57,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-10-15 01:31:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 01:31:57,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:57,403 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:57,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash -171915918, now seen corresponding path program 1 times [2019-10-15 01:31:57,405 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:57,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054527943] [2019-10-15 01:31:57,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,405 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:31:57,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054527943] [2019-10-15 01:31:57,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:31:57,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:31:57,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403085919] [2019-10-15 01:31:57,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:31:57,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:57,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:31:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:31:57,496 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2019-10-15 01:31:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:57,577 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2019-10-15 01:31:57,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:31:57,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 01:31:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:57,581 INFO L225 Difference]: With dead ends: 59 [2019-10-15 01:31:57,582 INFO L226 Difference]: Without dead ends: 38 [2019-10-15 01:31:57,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:31:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-15 01:31:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-15 01:31:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 01:31:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2019-10-15 01:31:57,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 15 [2019-10-15 01:31:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:57,596 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2019-10-15 01:31:57,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:31:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2019-10-15 01:31:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 01:31:57,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:57,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:57,599 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1528376143, now seen corresponding path program 1 times [2019-10-15 01:31:57,599 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:57,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396724620] [2019-10-15 01:31:57,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,600 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:57,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:57,680 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 01:31:57,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396724620] [2019-10-15 01:31:57,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843186298] [2019-10-15 01:31:57,681 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 01:31:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:57,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:31:57,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:57,779 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 01:31:57,779 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:57,812 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 01:31:57,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091648242] [2019-10-15 01:31:57,839 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-15 01:31:57,839 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:57,846 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:57,854 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:57,855 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:58,048 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:31:58,421 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 3 for LOIs [2019-10-15 01:31:58,432 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:31:58,439 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:31:58,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:31:58,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 4, 4] total 18 [2019-10-15 01:31:58,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201286575] [2019-10-15 01:31:58,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:31:58,759 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:31:58,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:31:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:31:58,761 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 11 states. [2019-10-15 01:31:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:31:59,178 INFO L93 Difference]: Finished difference Result 63 states and 88 transitions. [2019-10-15 01:31:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:31:59,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-10-15 01:31:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:31:59,180 INFO L225 Difference]: With dead ends: 63 [2019-10-15 01:31:59,181 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:31:59,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:31:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:31:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-10-15 01:31:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-15 01:31:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2019-10-15 01:31:59,200 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 16 [2019-10-15 01:31:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:31:59,201 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2019-10-15 01:31:59,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:31:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2019-10-15 01:31:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-15 01:31:59,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:31:59,203 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:31:59,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:31:59,407 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:31:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:31:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2138333176, now seen corresponding path program 1 times [2019-10-15 01:31:59,409 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:31:59,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971626099] [2019-10-15 01:31:59,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:59,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:31:59,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:31:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:31:59,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971626099] [2019-10-15 01:31:59,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776430795] [2019-10-15 01:31:59,460 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 01:31:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:31:59,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:31:59,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:31:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-15 01:31:59,556 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:31:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:31:59,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1884302227] [2019-10-15 01:31:59,587 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:31:59,587 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:31:59,588 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:31:59,588 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:31:59,588 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:31:59,641 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:00,052 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:00,079 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:00,084 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:00,569 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:00,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 14] total 22 [2019-10-15 01:32:00,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79178784] [2019-10-15 01:32:00,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-15 01:32:00,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-15 01:32:00,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2019-10-15 01:32:00,572 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 22 states. [2019-10-15 01:32:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:01,703 INFO L93 Difference]: Finished difference Result 112 states and 162 transitions. [2019-10-15 01:32:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:32:01,703 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2019-10-15 01:32:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:01,705 INFO L225 Difference]: With dead ends: 112 [2019-10-15 01:32:01,705 INFO L226 Difference]: Without dead ends: 81 [2019-10-15 01:32:01,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2019-10-15 01:32:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-15 01:32:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 43. [2019-10-15 01:32:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-15 01:32:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-15 01:32:01,720 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 23 [2019-10-15 01:32:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:01,721 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-15 01:32:01,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-15 01:32:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-15 01:32:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:32:01,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:01,722 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:01,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:01,926 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 17647327, now seen corresponding path program 2 times [2019-10-15 01:32:01,927 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:01,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392163629] [2019-10-15 01:32:01,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:01,928 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:01,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:32:02,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392163629] [2019-10-15 01:32:02,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445015248] [2019-10-15 01:32:02,056 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 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 01:32:02,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-15 01:32:02,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:32:02,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-15 01:32:02,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:32:02,148 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 01:32:02,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425964028] [2019-10-15 01:32:02,192 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:02,192 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:02,193 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:02,193 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:02,194 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:02,228 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:02,558 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:02,584 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:02,590 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:03,097 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:03,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 14] total 27 [2019-10-15 01:32:03,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570218859] [2019-10-15 01:32:03,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-15 01:32:03,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:03,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-15 01:32:03,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-10-15 01:32:03,099 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 27 states. [2019-10-15 01:32:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:04,144 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2019-10-15 01:32:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-15 01:32:04,145 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-10-15 01:32:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:04,146 INFO L225 Difference]: With dead ends: 92 [2019-10-15 01:32:04,146 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 01:32:04,149 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=421, Invalid=1931, Unknown=0, NotChecked=0, Total=2352 [2019-10-15 01:32:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 01:32:04,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-10-15 01:32:04,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-15 01:32:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-10-15 01:32:04,160 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 27 [2019-10-15 01:32:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:04,161 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-10-15 01:32:04,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-15 01:32:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-10-15 01:32:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 01:32:04,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:04,162 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:04,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:04,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:04,367 INFO L82 PathProgramCache]: Analyzing trace with hash 534790175, now seen corresponding path program 3 times [2019-10-15 01:32:04,367 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:04,367 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580741228] [2019-10-15 01:32:04,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:04,367 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:04,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:32:04,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580741228] [2019-10-15 01:32:04,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103133183] [2019-10-15 01:32:04,426 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 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 01:32:04,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:32:04,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:32:04,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:32:04,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:32:04,518 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:32:04,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1219076681] [2019-10-15 01:32:04,576 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:04,576 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:04,577 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:04,577 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:04,577 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:04,597 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:04,810 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:04,827 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:04,830 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:05,306 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:05,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 14] total 26 [2019-10-15 01:32:05,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964806562] [2019-10-15 01:32:05,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-15 01:32:05,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:05,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-15 01:32:05,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2019-10-15 01:32:05,309 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 26 states. [2019-10-15 01:32:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:06,106 INFO L93 Difference]: Finished difference Result 105 states and 138 transitions. [2019-10-15 01:32:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-15 01:32:06,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 31 [2019-10-15 01:32:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:06,108 INFO L225 Difference]: With dead ends: 105 [2019-10-15 01:32:06,108 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 01:32:06,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2019-10-15 01:32:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 01:32:06,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-10-15 01:32:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-15 01:32:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2019-10-15 01:32:06,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 31 [2019-10-15 01:32:06,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:06,130 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2019-10-15 01:32:06,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-15 01:32:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2019-10-15 01:32:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 01:32:06,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:06,133 INFO L380 BasicCegarLoop]: trace histogram [10, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:06,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:06,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1692693663, now seen corresponding path program 4 times [2019-10-15 01:32:06,344 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:06,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935805510] [2019-10-15 01:32:06,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:06,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:32:06,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935805510] [2019-10-15 01:32:06,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665628269] [2019-10-15 01:32:06,505 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 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 01:32:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:06,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:32:06,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:32:06,601 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:32:06,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [211612765] [2019-10-15 01:32:06,800 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:06,800 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:06,800 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:06,801 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:06,801 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:06,833 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:07,004 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:07,018 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:07,021 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:07,520 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:07,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 14] total 38 [2019-10-15 01:32:07,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974952062] [2019-10-15 01:32:07,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-15 01:32:07,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-15 01:32:07,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=1063, Unknown=0, NotChecked=0, Total=1406 [2019-10-15 01:32:07,522 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand 38 states. [2019-10-15 01:32:08,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:08,811 INFO L93 Difference]: Finished difference Result 117 states and 156 transitions. [2019-10-15 01:32:08,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-15 01:32:08,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-10-15 01:32:08,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:08,812 INFO L225 Difference]: With dead ends: 117 [2019-10-15 01:32:08,812 INFO L226 Difference]: Without dead ends: 73 [2019-10-15 01:32:08,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2019-10-15 01:32:08,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-15 01:32:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-10-15 01:32:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-15 01:32:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2019-10-15 01:32:08,823 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 37 [2019-10-15 01:32:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:08,824 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2019-10-15 01:32:08,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-15 01:32:08,824 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2019-10-15 01:32:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 01:32:08,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:08,826 INFO L380 BasicCegarLoop]: trace histogram [22, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:09,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:09,030 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash -873939553, now seen corresponding path program 5 times [2019-10-15 01:32:09,031 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:09,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457492374] [2019-10-15 01:32:09,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:09,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:09,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 253 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-15 01:32:09,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457492374] [2019-10-15 01:32:09,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426996345] [2019-10-15 01:32:09,314 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 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 01:32:09,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-15 01:32:09,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:32:09,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-15 01:32:09,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2019-10-15 01:32:09,541 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-15 01:32:09,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [821326002] [2019-10-15 01:32:09,729 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:09,729 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:09,729 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:09,730 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:09,730 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:09,746 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:09,919 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:09,939 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:09,943 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:10,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:10,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 10, 10, 14] total 54 [2019-10-15 01:32:10,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552836800] [2019-10-15 01:32:10,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-15 01:32:10,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-15 01:32:10,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2385, Unknown=0, NotChecked=0, Total=2862 [2019-10-15 01:32:10,626 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 54 states. [2019-10-15 01:32:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:13,737 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2019-10-15 01:32:13,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-15 01:32:13,738 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 49 [2019-10-15 01:32:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:13,740 INFO L225 Difference]: With dead ends: 138 [2019-10-15 01:32:13,740 INFO L226 Difference]: Without dead ends: 94 [2019-10-15 01:32:13,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1811, Invalid=10399, Unknown=0, NotChecked=0, Total=12210 [2019-10-15 01:32:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-15 01:32:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-10-15 01:32:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-15 01:32:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-10-15 01:32:13,756 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 49 [2019-10-15 01:32:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:13,757 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-10-15 01:32:13,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-15 01:32:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-10-15 01:32:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 01:32:13,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:13,758 INFO L380 BasicCegarLoop]: trace histogram [23, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:13,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:13,962 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1343976277, now seen corresponding path program 6 times [2019-10-15 01:32:13,963 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:13,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991017596] [2019-10-15 01:32:13,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:13,964 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:32:14,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991017596] [2019-10-15 01:32:14,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750355209] [2019-10-15 01:32:14,327 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 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 01:32:14,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-15 01:32:14,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:32:14,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-15 01:32:14,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:14,472 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-15 01:32:14,472 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 2 proven. 276 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:32:15,100 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1874294921] [2019-10-15 01:32:15,102 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:15,102 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:15,102 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:15,103 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:15,103 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:15,129 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:15,309 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:15,321 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:15,324 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:15,875 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:15,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 14] total 64 [2019-10-15 01:32:15,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529830645] [2019-10-15 01:32:15,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-15 01:32:15,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-15 01:32:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1318, Invalid=2714, Unknown=0, NotChecked=0, Total=4032 [2019-10-15 01:32:15,879 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 64 states. [2019-10-15 01:32:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:18,531 INFO L93 Difference]: Finished difference Result 167 states and 219 transitions. [2019-10-15 01:32:18,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-15 01:32:18,531 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 58 [2019-10-15 01:32:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:18,533 INFO L225 Difference]: With dead ends: 167 [2019-10-15 01:32:18,534 INFO L226 Difference]: Without dead ends: 111 [2019-10-15 01:32:18,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3866, Invalid=11140, Unknown=0, NotChecked=0, Total=15006 [2019-10-15 01:32:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-15 01:32:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-10-15 01:32:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-15 01:32:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-10-15 01:32:18,552 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 58 [2019-10-15 01:32:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:18,553 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-10-15 01:32:18,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-15 01:32:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-10-15 01:32:18,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 01:32:18,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:18,555 INFO L380 BasicCegarLoop]: trace histogram [48, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:18,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:18,764 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1354658719, now seen corresponding path program 7 times [2019-10-15 01:32:18,765 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:18,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109720344] [2019-10-15 01:32:18,765 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:18,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:18,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 2 proven. 1176 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:32:19,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109720344] [2019-10-15 01:32:19,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311893868] [2019-10-15 01:32:19,764 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 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 01:32:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:19,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-15 01:32:19,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-15 01:32:19,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 2 proven. 1176 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:32:22,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1529521917] [2019-10-15 01:32:22,542 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:22,542 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:22,543 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:22,543 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:22,543 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:22,561 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:22,758 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:22,768 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:22,771 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 01:32:23,506 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-15 01:32:23,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51, 14] total 114 [2019-10-15 01:32:23,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009990034] [2019-10-15 01:32:23,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-10-15 01:32:23,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 01:32:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-10-15 01:32:23,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5093, Invalid=7789, Unknown=0, NotChecked=0, Total=12882 [2019-10-15 01:32:23,512 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 114 states. [2019-10-15 01:32:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:32:31,031 INFO L93 Difference]: Finished difference Result 217 states and 294 transitions. [2019-10-15 01:32:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-15 01:32:31,034 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 83 [2019-10-15 01:32:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:32:31,036 INFO L225 Difference]: With dead ends: 217 [2019-10-15 01:32:31,036 INFO L226 Difference]: Without dead ends: 161 [2019-10-15 01:32:31,040 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10802 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15091, Invalid=34415, Unknown=0, NotChecked=0, Total=49506 [2019-10-15 01:32:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-15 01:32:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-15 01:32:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-15 01:32:31,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 174 transitions. [2019-10-15 01:32:31,056 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 174 transitions. Word has length 83 [2019-10-15 01:32:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:32:31,056 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 174 transitions. [2019-10-15 01:32:31,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-10-15 01:32:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 174 transitions. [2019-10-15 01:32:31,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 01:32:31,058 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:32:31,059 INFO L380 BasicCegarLoop]: trace histogram [98, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:32:31,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:31,268 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:32:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:32:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1606633759, now seen corresponding path program 8 times [2019-10-15 01:32:31,269 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 01:32:31,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914021448] [2019-10-15 01:32:31,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:31,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:32:31,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:32:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:32:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 2 proven. 4851 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-15 01:32:35,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914021448] [2019-10-15 01:32:35,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838701376] [2019-10-15 01:32:35,111 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:32:35,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-15 01:32:35,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-15 01:32:35,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 01:32:35,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:32:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 4855 trivial. 0 not checked. [2019-10-15 01:32:36,324 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:32:37,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 2 proven. 105 refuted. 0 times theorem prover too weak. 4853 trivial. 0 not checked. [2019-10-15 01:32:37,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [490662390] [2019-10-15 01:32:37,217 INFO L162 IcfgInterpreter]: Started Sifa with 18 locations of interest [2019-10-15 01:32:37,217 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 01:32:37,218 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 01:32:37,218 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 01:32:37,218 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 01:32:37,233 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-15 01:32:37,400 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-15 01:32:37,415 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-15 01:32:37,417 INFO L183 IcfgInterpreter]: Interpretation finished