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 -i ../../../trunk/examples/svcomp/reducercommutativity/sep10-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:59:12,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:59:12,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:59:12,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:59:12,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:59:12,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:59:12,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:59:12,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:59:12,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:59:12,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:59:12,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:59:12,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:59:12,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:59:12,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:59:12,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:59:12,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:59:12,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:59:12,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:59:12,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:59:12,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:59:12,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:59:12,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:59:12,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:59:12,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:59:12,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:59:12,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:59:12,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:59:12,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:59:12,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:59:12,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:59:12,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:59:12,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:59:12,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:59:12,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:59:12,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:59:12,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:59:12,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:59:12,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:59:12,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:59:12,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:59:12,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:59:12,573 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-09-20 12:59:12,588 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:59:12,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:59:12,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:59:12,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:59:12,590 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:59:12,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:59:12,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:59:12,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:59:12,591 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:59:12,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:59:12,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:59:12,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:59:12,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:59:12,592 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:59:12,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:59:12,592 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:59:12,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:59:12,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:59:12,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:59:12,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:59:12,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:59:12,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:12,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:59:12,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:59:12,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:59:12,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:59:12,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:59:12,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:59:12,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:59:12,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:59:12,635 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:59:12,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:59:12,640 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:59:12,640 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:59:12,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep10-2.i [2019-09-20 12:59:12,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2170041a7/f6aa286abbb240f8a465af42c5132d77/FLAG319b70cb7 [2019-09-20 12:59:13,120 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:13,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep10-2.i [2019-09-20 12:59:13,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2170041a7/f6aa286abbb240f8a465af42c5132d77/FLAG319b70cb7 [2019-09-20 12:59:13,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2170041a7/f6aa286abbb240f8a465af42c5132d77 [2019-09-20 12:59:13,499 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:13,501 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:13,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:13,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:13,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:13,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:13,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fec55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13, skipping insertion in model container [2019-09-20 12:59:13,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:13,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:13,533 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:13,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:13,791 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:13,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:13,969 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:13,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13 WrapperNode [2019-09-20 12:59:13,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:13,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:13,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:13,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:13,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:13,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... [2019-09-20 12:59:14,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:14,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:14,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:14,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:14,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:59:14,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:14,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:14,092 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-09-20 12:59:14,092 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:14,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 12:59:14,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 12:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:14,383 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:14,383 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 12:59:14,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:14 BoogieIcfgContainer [2019-09-20 12:59:14,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:14,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:14,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:14,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:14,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:13" (1/3) ... [2019-09-20 12:59:14,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51571a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:14, skipping insertion in model container [2019-09-20 12:59:14,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:13" (2/3) ... [2019-09-20 12:59:14,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51571a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:14, skipping insertion in model container [2019-09-20 12:59:14,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:14" (3/3) ... [2019-09-20 12:59:14,394 INFO L109 eAbstractionObserver]: Analyzing ICFG sep10-2.i [2019-09-20 12:59:14,406 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:14,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:14,442 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:14,475 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:14,475 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:14,475 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:14,476 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:14,476 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:14,476 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:14,476 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:14,476 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:14,477 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-09-20 12:59:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:14,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:14,515 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:14,517 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:14,523 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-09-20 12:59:14,525 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:14,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:14,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 12:59:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:14,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:14,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:14,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:14,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:14,716 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-09-20 12:59:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:14,745 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-09-20 12:59:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:14,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-20 12:59:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:14,754 INFO L225 Difference]: With dead ends: 56 [2019-09-20 12:59:14,755 INFO L226 Difference]: Without dead ends: 27 [2019-09-20 12:59:14,758 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-20 12:59:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-20 12:59:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 12:59:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-09-20 12:59:14,798 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-09-20 12:59:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:14,798 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-09-20 12:59:14,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-09-20 12:59:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:59:14,800 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:14,801 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:14,801 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-09-20 12:59:14,802 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:14,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:14,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:14,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 12:59:14,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:14,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:14,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:14,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:14,888 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-09-20 12:59:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:14,917 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-09-20 12:59:14,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:14,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 12:59:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:14,919 INFO L225 Difference]: With dead ends: 48 [2019-09-20 12:59:14,919 INFO L226 Difference]: Without dead ends: 29 [2019-09-20 12:59:14,920 INFO L636 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-09-20 12:59:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-20 12:59:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-09-20 12:59:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 12:59:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-09-20 12:59:14,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-09-20 12:59:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:14,928 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-09-20 12:59:14,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-09-20 12:59:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:59:14,929 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:14,930 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:14,930 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-09-20 12:59:14,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 12:59:15,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:15,016 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 12:59:15,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:15,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-20 12:59:15,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:59:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:59:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:15,149 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-09-20 12:59:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,174 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-09-20 12:59:15,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:15,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-20 12:59:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,176 INFO L225 Difference]: With dead ends: 49 [2019-09-20 12:59:15,176 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:59:15,177 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:59:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:59:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-20 12:59:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:59:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-09-20 12:59:15,185 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-09-20 12:59:15,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,185 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-09-20 12:59:15,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:59:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-09-20 12:59:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-20 12:59:15,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,187 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,187 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-09-20 12:59:15,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 12:59:15,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:15,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:15,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:15,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:15,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:15,322 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-09-20 12:59:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,348 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-09-20 12:59:15,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:15,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-20 12:59:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,351 INFO L225 Difference]: With dead ends: 45 [2019-09-20 12:59:15,351 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:59:15,352 INFO L636 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-09-20 12:59:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:59:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-09-20 12:59:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-20 12:59:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-09-20 12:59:15,359 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-09-20 12:59:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,362 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-09-20 12:59:15,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-09-20 12:59:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 12:59:15,365 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,365 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,366 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-09-20 12:59:15,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 12:59:15,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:15,494 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:15,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:59:15,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 12:59:15,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:15,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-20 12:59:15,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:15,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:15,608 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-09-20 12:59:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,647 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-09-20 12:59:15,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:59:15,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-20 12:59:15,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,649 INFO L225 Difference]: With dead ends: 54 [2019-09-20 12:59:15,649 INFO L226 Difference]: Without dead ends: 33 [2019-09-20 12:59:15,650 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:15,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-20 12:59:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-09-20 12:59:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 12:59:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-09-20 12:59:15,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-09-20 12:59:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,656 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-09-20 12:59:15,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-09-20 12:59:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 12:59:15,658 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,658 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,658 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-09-20 12:59:15,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:15,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 12:59:15,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:15,749 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:15,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:15,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:15,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:15,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:15,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:15,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 12:59:15,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:15,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:15,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:15,867 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-09-20 12:59:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:15,915 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-09-20 12:59:15,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:15,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-09-20 12:59:15,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:15,916 INFO L225 Difference]: With dead ends: 56 [2019-09-20 12:59:15,917 INFO L226 Difference]: Without dead ends: 35 [2019-09-20 12:59:15,917 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-20 12:59:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-09-20 12:59:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-20 12:59:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-09-20 12:59:15,923 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2019-09-20 12:59:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:15,924 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-09-20 12:59:15,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-09-20 12:59:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 12:59:15,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:15,929 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:15,930 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:15,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2019-09-20 12:59:15,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:15,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:15,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:15,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 12:59:16,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:16,048 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:16,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:16,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-20 12:59:16,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:16,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:59:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 12:59:16,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:16,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-09-20 12:59:16,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 12:59:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 12:59:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:16,170 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2019-09-20 12:59:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,245 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-09-20 12:59:16,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:16,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 12:59:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,249 INFO L225 Difference]: With dead ends: 63 [2019-09-20 12:59:16,249 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 12:59:16,250 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:59:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 12:59:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-20 12:59:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-20 12:59:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-09-20 12:59:16,260 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2019-09-20 12:59:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,260 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-09-20 12:59:16,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 12:59:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-09-20 12:59:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 12:59:16,263 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:16,263 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:16,264 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2019-09-20 12:59:16,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:16,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:16,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-20 12:59:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:16,418 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:16,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:16,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:16,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:16,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:16,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-20 12:59:16,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-20 12:59:16,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:16,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:16,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:16,551 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2019-09-20 12:59:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,585 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-09-20 12:59:16,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:16,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-20 12:59:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,587 INFO L225 Difference]: With dead ends: 67 [2019-09-20 12:59:16,587 INFO L226 Difference]: Without dead ends: 44 [2019-09-20 12:59:16,590 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-20 12:59:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-09-20 12:59:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 12:59:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-09-20 12:59:16,601 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 60 [2019-09-20 12:59:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,602 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-09-20 12:59:16,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-09-20 12:59:16,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 12:59:16,605 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:16,607 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:16,607 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1977898503, now seen corresponding path program 5 times [2019-09-20 12:59:16,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:16,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:16,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-20 12:59:16,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:16,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:16,760 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:16,836 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-09-20 12:59:16,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:16,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:59:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-20 12:59:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-20 12:59:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:16,904 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 11 states. [2019-09-20 12:59:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:16,976 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-09-20 12:59:16,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:16,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-09-20 12:59:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:16,979 INFO L225 Difference]: With dead ends: 77 [2019-09-20 12:59:16,979 INFO L226 Difference]: Without dead ends: 50 [2019-09-20 12:59:16,982 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-20 12:59:16,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-20 12:59:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-20 12:59:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-09-20 12:59:16,995 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 69 [2019-09-20 12:59:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:16,998 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-09-20 12:59:16,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:16,998 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-09-20 12:59:17,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 12:59:17,002 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:17,002 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:17,005 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash -174901602, now seen corresponding path program 6 times [2019-09-20 12:59:17,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:17,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-09-20 12:59:17,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:17,129 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:17,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:17,214 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-20 12:59:17,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:17,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:59:17,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-09-20 12:59:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:17,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-09-20 12:59:17,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:17,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:17,275 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 10 states. [2019-09-20 12:59:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:17,349 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-09-20 12:59:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:17,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-20 12:59:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:17,351 INFO L225 Difference]: With dead ends: 83 [2019-09-20 12:59:17,352 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 12:59:17,355 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:17,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 12:59:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-09-20 12:59:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-20 12:59:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-09-20 12:59:17,366 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 80 [2019-09-20 12:59:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:17,366 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-09-20 12:59:17,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-09-20 12:59:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 12:59:17,370 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:17,370 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:17,371 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:17,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 16242046, now seen corresponding path program 7 times [2019-09-20 12:59:17,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:17,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-20 12:59:17,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:17,507 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:17,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:17,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:17,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-20 12:59:17,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:17,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-20 12:59:17,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:17,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:17,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:17,632 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2019-09-20 12:59:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:17,677 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-09-20 12:59:17,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:17,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-09-20 12:59:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:17,681 INFO L225 Difference]: With dead ends: 86 [2019-09-20 12:59:17,682 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 12:59:17,682 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 12:59:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-20 12:59:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 12:59:17,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-09-20 12:59:17,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 84 [2019-09-20 12:59:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:17,700 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-09-20 12:59:17,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-09-20 12:59:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-20 12:59:17,702 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:17,702 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:17,704 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 27018272, now seen corresponding path program 8 times [2019-09-20 12:59:17,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:17,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:17,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-20 12:59:17,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:17,843 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:17,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:17,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:17,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:17,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:59:17,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-20 12:59:17,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-20 12:59:17,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:17,971 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2019-09-20 12:59:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:18,025 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-09-20 12:59:18,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:18,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-09-20 12:59:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:18,027 INFO L225 Difference]: With dead ends: 88 [2019-09-20 12:59:18,029 INFO L226 Difference]: Without dead ends: 56 [2019-09-20 12:59:18,030 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-20 12:59:18,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-20 12:59:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-20 12:59:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-09-20 12:59:18,038 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 86 [2019-09-20 12:59:18,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:18,039 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-09-20 12:59:18,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-09-20 12:59:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 12:59:18,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:18,041 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:18,041 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:18,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1793036866, now seen corresponding path program 9 times [2019-09-20 12:59:18,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:18,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-20 12:59:18,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:18,183 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:18,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:18,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-20 12:59:18,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:18,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:59:18,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-20 12:59:18,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:18,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-20 12:59:18,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:59:18,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:59:18,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:59:18,303 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 14 states. [2019-09-20 12:59:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:18,376 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2019-09-20 12:59:18,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 12:59:18,377 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-09-20 12:59:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:18,378 INFO L225 Difference]: With dead ends: 93 [2019-09-20 12:59:18,378 INFO L226 Difference]: Without dead ends: 61 [2019-09-20 12:59:18,379 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:59:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-20 12:59:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-09-20 12:59:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-20 12:59:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-09-20 12:59:18,384 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 88 [2019-09-20 12:59:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:18,384 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-09-20 12:59:18,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:59:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-09-20 12:59:18,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-20 12:59:18,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:18,386 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:18,386 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:18,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1251186210, now seen corresponding path program 10 times [2019-09-20 12:59:18,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:18,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:18,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:18,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-20 12:59:18,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:18,518 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:18,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-20 12:59:18,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:18,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:18,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 12:59:18,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-20 12:59:18,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-09-20 12:59:18,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 12:59:18,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 12:59:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:18,729 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 17 states. [2019-09-20 12:59:18,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:18,809 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2019-09-20 12:59:18,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 12:59:18,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2019-09-20 12:59:18,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:18,811 INFO L225 Difference]: With dead ends: 100 [2019-09-20 12:59:18,811 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 12:59:18,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 12:59:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-09-20 12:59:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-09-20 12:59:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-09-20 12:59:18,819 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 92 [2019-09-20 12:59:18,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:18,819 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-09-20 12:59:18,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 12:59:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-09-20 12:59:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 12:59:18,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:18,821 INFO L407 BasicCegarLoop]: trace histogram [15, 15, 15, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:18,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2058184687, now seen corresponding path program 11 times [2019-09-20 12:59:18,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:18,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:18,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-20 12:59:19,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:19,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:19,111 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:59:19,433 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-20 12:59:19,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:19,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:59:19,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-09-20 12:59:19,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:19,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-20 12:59:19,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:59:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:59:19,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:19,463 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 9 states. [2019-09-20 12:59:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:19,498 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-09-20 12:59:19,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:19,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-20 12:59:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:19,502 INFO L225 Difference]: With dead ends: 105 [2019-09-20 12:59:19,502 INFO L226 Difference]: Without dead ends: 69 [2019-09-20 12:59:19,503 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:19,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-20 12:59:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-09-20 12:59:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-20 12:59:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-09-20 12:59:19,517 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 103 [2019-09-20 12:59:19,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:19,518 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-09-20 12:59:19,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:59:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-09-20 12:59:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 12:59:19,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:19,520 INFO L407 BasicCegarLoop]: trace histogram [18, 18, 18, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:19,520 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:19,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:19,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1611383708, now seen corresponding path program 12 times [2019-09-20 12:59:19,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:19,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:19,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:19,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:19,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 124 proven. 175 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-09-20 12:59:19,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:19,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:19,836 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-20 12:59:19,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:19,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:59:19,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 250 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-20 12:59:19,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:19,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-20 12:59:19,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:59:19,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:59:19,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:19,912 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 13 states. [2019-09-20 12:59:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:19,975 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2019-09-20 12:59:19,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:59:19,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-20 12:59:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:19,979 INFO L225 Difference]: With dead ends: 114 [2019-09-20 12:59:19,979 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 12:59:19,980 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 12:59:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-09-20 12:59:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 12:59:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-09-20 12:59:19,987 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 112 [2019-09-20 12:59:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:19,988 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-09-20 12:59:19,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:59:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-09-20 12:59:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 12:59:19,990 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:19,990 INFO L407 BasicCegarLoop]: trace histogram [21, 21, 21, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:19,991 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:19,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2115527283, now seen corresponding path program 13 times [2019-09-20 12:59:19,992 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:19,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:19,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:19,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 165 proven. 235 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-09-20 12:59:20,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:20,210 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:20,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:20,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:59:20,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-09-20 12:59:20,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:20,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-20 12:59:20,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:20,346 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 11 states. [2019-09-20 12:59:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:20,384 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-09-20 12:59:20,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:20,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-09-20 12:59:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:20,386 INFO L225 Difference]: With dead ends: 121 [2019-09-20 12:59:20,386 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 12:59:20,387 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 12:59:20,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-09-20 12:59:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-20 12:59:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-09-20 12:59:20,395 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 123 [2019-09-20 12:59:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:20,395 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-09-20 12:59:20,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-09-20 12:59:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-20 12:59:20,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:20,397 INFO L407 BasicCegarLoop]: trace histogram [24, 24, 24, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:20,397 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:20,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash -638066878, now seen corresponding path program 14 times [2019-09-20 12:59:20,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:20,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-20 12:59:20,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:20,637 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:20,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:20,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:20,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:59:20,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 420 proven. 92 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-09-20 12:59:20,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:20,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-20 12:59:20,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 12:59:20,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 12:59:20,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:20,798 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2019-09-20 12:59:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:20,845 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-09-20 12:59:20,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:20,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2019-09-20 12:59:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:20,848 INFO L225 Difference]: With dead ends: 127 [2019-09-20 12:59:20,848 INFO L226 Difference]: Without dead ends: 80 [2019-09-20 12:59:20,849 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-20 12:59:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-09-20 12:59:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-20 12:59:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-09-20 12:59:20,856 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 132 [2019-09-20 12:59:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:20,856 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-09-20 12:59:20,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 12:59:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-09-20 12:59:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 12:59:20,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:20,858 INFO L407 BasicCegarLoop]: trace histogram [27, 27, 27, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:20,859 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:20,859 INFO L82 PathProgramCache]: Analyzing trace with hash -720039853, now seen corresponding path program 15 times [2019-09-20 12:59:20,859 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:20,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:20,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:20,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 265 proven. 382 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-09-20 12:59:21,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:21,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:21,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 12:59:21,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-20 12:59:21,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:21,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 12:59:21,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 532 proven. 16 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-09-20 12:59:21,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:21,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-09-20 12:59:21,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-20 12:59:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-20 12:59:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:21,274 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 17 states. [2019-09-20 12:59:21,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:21,363 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2019-09-20 12:59:21,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 12:59:21,363 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2019-09-20 12:59:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:21,364 INFO L225 Difference]: With dead ends: 134 [2019-09-20 12:59:21,365 INFO L226 Difference]: Without dead ends: 84 [2019-09-20 12:59:21,365 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:59:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-20 12:59:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-09-20 12:59:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-20 12:59:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-09-20 12:59:21,370 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 141 [2019-09-20 12:59:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:21,370 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-09-20 12:59:21,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-20 12:59:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-09-20 12:59:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-20 12:59:21,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:21,373 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:21,373 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1444910496, now seen corresponding path program 16 times [2019-09-20 12:59:21,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:21,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-20 12:59:21,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:21,576 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:21,611 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:21,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-20 12:59:21,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:21,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:59:21,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 650 proven. 25 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-20 12:59:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-20 12:59:21,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:59:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:59:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:21,765 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 9 states. [2019-09-20 12:59:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:21,793 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-09-20 12:59:21,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:21,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2019-09-20 12:59:21,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:21,794 INFO L225 Difference]: With dead ends: 127 [2019-09-20 12:59:21,795 INFO L226 Difference]: Without dead ends: 86 [2019-09-20 12:59:21,795 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-20 12:59:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-09-20 12:59:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-20 12:59:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-09-20 12:59:21,799 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 152 [2019-09-20 12:59:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:21,800 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-09-20 12:59:21,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:59:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-09-20 12:59:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 12:59:21,802 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:21,802 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:21,802 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1810174302, now seen corresponding path program 17 times [2019-09-20 12:59:21,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:21,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:21,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-20 12:59:22,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:22,006 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:22,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-20 12:59:22,780 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-20 12:59:22,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:22,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:59:22,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:22,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:22,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-20 12:59:22,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:22,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:22,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:22,849 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 10 states. [2019-09-20 12:59:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:22,890 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-09-20 12:59:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:22,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-20 12:59:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:22,891 INFO L225 Difference]: With dead ends: 129 [2019-09-20 12:59:22,891 INFO L226 Difference]: Without dead ends: 88 [2019-09-20 12:59:22,892 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-20 12:59:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-09-20 12:59:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-09-20 12:59:22,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-09-20 12:59:22,900 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 154 [2019-09-20 12:59:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:22,901 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-09-20 12:59:22,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-09-20 12:59:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 12:59:22,903 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:22,903 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:22,903 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:22,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:22,903 INFO L82 PathProgramCache]: Analyzing trace with hash 641373596, now seen corresponding path program 18 times [2019-09-20 12:59:22,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:22,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-20 12:59:23,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:23,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:23,150 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-20 12:59:23,577 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-20 12:59:23,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:23,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:59:23,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-20 12:59:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-20 12:59:23,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:23,617 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 11 states. [2019-09-20 12:59:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:23,650 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-09-20 12:59:23,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:23,652 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 156 [2019-09-20 12:59:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:23,653 INFO L225 Difference]: With dead ends: 131 [2019-09-20 12:59:23,653 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 12:59:23,653 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 12:59:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-09-20 12:59:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-09-20 12:59:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-09-20 12:59:23,658 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 156 [2019-09-20 12:59:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:23,658 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-09-20 12:59:23,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-09-20 12:59:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 12:59:23,660 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:23,660 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:23,661 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1589640614, now seen corresponding path program 19 times [2019-09-20 12:59:23,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:23,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-09-20 12:59:23,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:23,902 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:59:23,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:24,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:59:24,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:59:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:24,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-20 12:59:24,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-20 12:59:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-20 12:59:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:24,089 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 12 states. [2019-09-20 12:59:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:24,139 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2019-09-20 12:59:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:24,139 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2019-09-20 12:59:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:24,140 INFO L225 Difference]: With dead ends: 132 [2019-09-20 12:59:24,140 INFO L226 Difference]: Without dead ends: 91 [2019-09-20 12:59:24,141 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-20 12:59:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-09-20 12:59:24,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 12:59:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-09-20 12:59:24,146 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 158 [2019-09-20 12:59:24,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:24,146 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-09-20 12:59:24,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-20 12:59:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-09-20 12:59:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 12:59:24,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:24,148 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:24,149 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:24,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1889351576, now seen corresponding path program 20 times [2019-09-20 12:59:24,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:24,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:24,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:24,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:24,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 1309 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-09-20 12:59:25,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:25,459 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:25,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:25,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:25,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:25,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 107 conjunts are in the unsatisfiable core [2019-09-20 12:59:25,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:25,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:25,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 60 proven. 1305 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-09-20 12:59:26,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:26,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 40] total 43 [2019-09-20 12:59:26,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-20 12:59:26,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-20 12:59:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1694, Unknown=0, NotChecked=0, Total=1806 [2019-09-20 12:59:26,705 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 43 states. [2019-09-20 12:59:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:28,213 INFO L93 Difference]: Finished difference Result 299 states and 417 transitions. [2019-09-20 12:59:28,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-20 12:59:28,214 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2019-09-20 12:59:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:28,222 INFO L225 Difference]: With dead ends: 299 [2019-09-20 12:59:28,222 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 12:59:28,224 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=1775, Unknown=0, NotChecked=0, Total=1892 [2019-09-20 12:59:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 12:59:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 233. [2019-09-20 12:59:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-09-20 12:59:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 299 transitions. [2019-09-20 12:59:28,268 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 299 transitions. Word has length 160 [2019-09-20 12:59:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:28,268 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 299 transitions. [2019-09-20 12:59:28,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-20 12:59:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 299 transitions. [2019-09-20 12:59:28,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 12:59:28,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:28,272 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:28,272 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:28,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1725557350, now seen corresponding path program 1 times [2019-09-20 12:59:28,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:28,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:28,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:28,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 62 proven. 1275 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-09-20 12:59:30,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:30,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:30,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:30,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-20 12:59:30,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:30,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 12:59:30,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-09-20 12:59:30,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:30,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:30,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:30,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-09-20 12:59:31,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 12:59:31,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-09-20 12:59:31,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-09-20 12:59:31,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:31,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:31,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-09-20 12:59:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 651 proven. 487 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-09-20 12:59:32,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:59:32,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 51 [2019-09-20 12:59:32,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-20 12:59:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-20 12:59:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2386, Unknown=0, NotChecked=0, Total=2550 [2019-09-20 12:59:32,016 INFO L87 Difference]: Start difference. First operand 233 states and 299 transitions. Second operand 51 states. [2019-09-20 12:59:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:40,106 INFO L93 Difference]: Finished difference Result 1254 states and 1742 transitions. [2019-09-20 12:59:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-09-20 12:59:40,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 160 [2019-09-20 12:59:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:40,116 INFO L225 Difference]: With dead ends: 1254 [2019-09-20 12:59:40,116 INFO L226 Difference]: Without dead ends: 966 [2019-09-20 12:59:40,125 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8843 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1264, Invalid=22916, Unknown=0, NotChecked=0, Total=24180 [2019-09-20 12:59:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-09-20 12:59:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 610. [2019-09-20 12:59:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-20 12:59:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 820 transitions. [2019-09-20 12:59:40,182 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 820 transitions. Word has length 160 [2019-09-20 12:59:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:40,182 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 820 transitions. [2019-09-20 12:59:40,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-20 12:59:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 820 transitions. [2019-09-20 12:59:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 12:59:40,188 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:40,188 INFO L407 BasicCegarLoop]: trace histogram [30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:40,188 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:40,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2147450282, now seen corresponding path program 2 times [2019-09-20 12:59:40,189 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:40,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 73 proven. 1490 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-20 12:59:44,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:59:44,685 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:44,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:44,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:44,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 115 conjunts are in the unsatisfiable core [2019-09-20 12:59:44,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:44,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-20 12:59:44,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 12:59:44,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 12:59:44,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 12:59:44,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2019-09-20 12:59:45,768 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:59:45,769 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-20 12:59:45,775 INFO L168 Benchmark]: Toolchain (without parser) took 32274.49 ms. Allocated memory was 130.0 MB in the beginning and 589.3 MB in the end (delta: 459.3 MB). Free memory was 85.7 MB in the beginning and 210.3 MB in the end (delta: -124.7 MB). Peak memory consumption was 334.6 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,775 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 130.0 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.03 ms. Allocated memory was 130.0 MB in the beginning and 199.2 MB in the end (delta: 69.2 MB). Free memory was 85.5 MB in the beginning and 176.4 MB in the end (delta: -90.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,777 INFO L168 Benchmark]: Boogie Preprocessor took 64.91 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,777 INFO L168 Benchmark]: RCFGBuilder took 348.76 ms. Allocated memory is still 199.2 MB. Free memory was 174.0 MB in the beginning and 157.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,778 INFO L168 Benchmark]: TraceAbstraction took 31387.30 ms. Allocated memory was 199.2 MB in the beginning and 589.3 MB in the end (delta: 390.1 MB). Free memory was 156.6 MB in the beginning and 210.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 336.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:59:45,782 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 130.0 MB. Free memory was 104.0 MB in the beginning and 103.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 469.03 ms. Allocated memory was 130.0 MB in the beginning and 199.2 MB in the end (delta: 69.2 MB). Free memory was 85.5 MB in the beginning and 176.4 MB in the end (delta: -90.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.91 ms. Allocated memory is still 199.2 MB. Free memory was 176.4 MB in the beginning and 174.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 348.76 ms. Allocated memory is still 199.2 MB. Free memory was 174.0 MB in the beginning and 157.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31387.30 ms. Allocated memory was 199.2 MB in the beginning and 589.3 MB in the end (delta: 390.1 MB). Free memory was 156.6 MB in the beginning and 210.3 MB in the end (delta: -53.7 MB). Peak memory consumption was 336.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...