/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem15_label43.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 21:15:49,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 21:15:49,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 21:15:49,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 21:15:49,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 21:15:49,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 21:15:49,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 21:15:49,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 21:15:49,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 21:15:49,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 21:15:49,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 21:15:49,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 21:15:49,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 21:15:49,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 21:15:49,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 21:15:49,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 21:15:49,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 21:15:49,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 21:15:49,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 21:15:49,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 21:15:49,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 21:15:49,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 21:15:49,455 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 21:15:49,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 21:15:49,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 21:15:49,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 21:15:49,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 21:15:49,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 21:15:49,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 21:15:49,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 21:15:49,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 21:15:49,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 21:15:49,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 21:15:49,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 21:15:49,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 21:15:49,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 21:15:49,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 21:15:49,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 21:15:49,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 21:15:49,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 21:15:49,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 21:15:49,473 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-11-23 21:15:49,492 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 21:15:49,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 21:15:49,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 21:15:49,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 21:15:49,494 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 21:15:49,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 21:15:49,495 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 21:15:49,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 21:15:49,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 21:15:49,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 21:15:49,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 21:15:49,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 21:15:49,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 21:15:49,497 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 21:15:49,497 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 21:15:49,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 21:15:49,497 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 21:15:49,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 21:15:49,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 21:15:49,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 21:15:49,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 21:15:49,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 21:15:49,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 21:15:49,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 21:15:49,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 21:15:49,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 21:15:49,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 21:15:49,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 21:15:49,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 21:15:49,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 21:15:49,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 21:15:49,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 21:15:49,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 21:15:49,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 21:15:49,839 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 21:15:49,840 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label43.c [2019-11-23 21:15:49,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96160eea4/4f32d9f2a5e3410f85f541f0e6e40d0e/FLAGfc9521875 [2019-11-23 21:15:50,566 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 21:15:50,567 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label43.c [2019-11-23 21:15:50,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96160eea4/4f32d9f2a5e3410f85f541f0e6e40d0e/FLAGfc9521875 [2019-11-23 21:15:50,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96160eea4/4f32d9f2a5e3410f85f541f0e6e40d0e [2019-11-23 21:15:50,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 21:15:50,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 21:15:50,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 21:15:50,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 21:15:50,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 21:15:50,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:50" (1/1) ... [2019-11-23 21:15:50,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ee337c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:50, skipping insertion in model container [2019-11-23 21:15:50,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:15:50" (1/1) ... [2019-11-23 21:15:50,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 21:15:50,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 21:15:51,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:15:51,709 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 21:15:52,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 21:15:52,162 INFO L208 MainTranslator]: Completed translation [2019-11-23 21:15:52,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52 WrapperNode [2019-11-23 21:15:52,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 21:15:52,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 21:15:52,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 21:15:52,164 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 21:15:52,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 21:15:52,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 21:15:52,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 21:15:52,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 21:15:52,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,516 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (1/1) ... [2019-11-23 21:15:52,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 21:15:52,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 21:15:52,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 21:15:52,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 21:15:52,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (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-11-23 21:15:52,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 21:15:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 21:15:57,422 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 21:15:57,422 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-23 21:15:57,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:15:57 BoogieIcfgContainer [2019-11-23 21:15:57,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 21:15:57,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 21:15:57,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 21:15:57,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 21:15:57,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:15:50" (1/3) ... [2019-11-23 21:15:57,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d19165c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:15:57, skipping insertion in model container [2019-11-23 21:15:57,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:15:52" (2/3) ... [2019-11-23 21:15:57,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d19165c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:15:57, skipping insertion in model container [2019-11-23 21:15:57,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:15:57" (3/3) ... [2019-11-23 21:15:57,432 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label43.c [2019-11-23 21:15:57,442 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 21:15:57,451 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 21:15:57,463 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 21:15:57,502 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 21:15:57,502 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 21:15:57,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 21:15:57,503 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 21:15:57,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 21:15:57,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 21:15:57,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 21:15:57,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 21:15:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-23 21:15:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 21:15:57,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:15:57,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:15:57,562 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:15:57,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:15:57,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-11-23 21:15:57,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:15:57,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271119138] [2019-11-23 21:15:57,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:15:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:15:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:15:57,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271119138] [2019-11-23 21:15:57,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:15:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:15:57,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809406735] [2019-11-23 21:15:57,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:15:57,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:15:57,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:15:57,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:15:57,974 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-23 21:16:03,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:03,594 INFO L93 Difference]: Finished difference Result 1469 states and 2719 transitions. [2019-11-23 21:16:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:03,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-23 21:16:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:03,624 INFO L225 Difference]: With dead ends: 1469 [2019-11-23 21:16:03,624 INFO L226 Difference]: Without dead ends: 978 [2019-11-23 21:16:03,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11-23 21:16:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-23 21:16:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-11-23 21:16:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-23 21:16:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1489 transitions. [2019-11-23 21:16:03,748 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1489 transitions. Word has length 58 [2019-11-23 21:16:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:03,749 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1489 transitions. [2019-11-23 21:16:03,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1489 transitions. [2019-11-23 21:16:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-23 21:16:03,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:03,756 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:03,757 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:03,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:03,757 INFO L82 PathProgramCache]: Analyzing trace with hash -327159309, now seen corresponding path program 1 times [2019-11-23 21:16:03,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:03,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350434957] [2019-11-23 21:16:03,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:04,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350434957] [2019-11-23 21:16:04,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:04,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:04,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604542698] [2019-11-23 21:16:04,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:04,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:04,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:04,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:04,095 INFO L87 Difference]: Start difference. First operand 974 states and 1489 transitions. Second operand 4 states. [2019-11-23 21:16:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:07,767 INFO L93 Difference]: Finished difference Result 3748 states and 5754 transitions. [2019-11-23 21:16:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:07,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-23 21:16:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:07,782 INFO L225 Difference]: With dead ends: 3748 [2019-11-23 21:16:07,783 INFO L226 Difference]: Without dead ends: 2776 [2019-11-23 21:16:07,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-11-23 21:16:07,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1873. [2019-11-23 21:16:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-11-23 21:16:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-11-23 21:16:07,836 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 177 [2019-11-23 21:16:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:07,837 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-11-23 21:16:07,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:07,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-11-23 21:16:07,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-23 21:16:07,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:07,846 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:07,846 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 746152796, now seen corresponding path program 1 times [2019-11-23 21:16:07,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:07,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244122112] [2019-11-23 21:16:07,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-23 21:16:08,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244122112] [2019-11-23 21:16:08,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099316011] [2019-11-23 21:16:08,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:08,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:08,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:08,921 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:08,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:08,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-23 21:16:08,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703025184] [2019-11-23 21:16:08,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:08,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:08,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:08,930 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 3 states. [2019-11-23 21:16:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:11,746 INFO L93 Difference]: Finished difference Result 4940 states and 6531 transitions. [2019-11-23 21:16:11,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:11,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-11-23 21:16:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:11,763 INFO L225 Difference]: With dead ends: 4940 [2019-11-23 21:16:11,764 INFO L226 Difference]: Without dead ends: 3069 [2019-11-23 21:16:11,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 328 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-11-23 21:16:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-23 21:16:11,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 1873. [2019-11-23 21:16:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-11-23 21:16:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-11-23 21:16:11,812 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 328 [2019-11-23 21:16:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:11,813 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-11-23 21:16:11,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-11-23 21:16:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-23 21:16:11,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:11,819 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:12,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:12,022 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash -319239402, now seen corresponding path program 1 times [2019-11-23 21:16:12,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:12,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937107604] [2019-11-23 21:16:12,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-23 21:16:12,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937107604] [2019-11-23 21:16:12,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:12,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:12,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582335863] [2019-11-23 21:16:12,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 21:16:12,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 21:16:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:12,820 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 5 states. [2019-11-23 21:16:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:17,252 INFO L93 Difference]: Finished difference Result 4643 states and 5995 transitions. [2019-11-23 21:16:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:17,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 335 [2019-11-23 21:16:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:17,267 INFO L225 Difference]: With dead ends: 4643 [2019-11-23 21:16:17,268 INFO L226 Difference]: Without dead ends: 2772 [2019-11-23 21:16:17,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-11-23 21:16:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2472. [2019-11-23 21:16:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-11-23 21:16:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3150 transitions. [2019-11-23 21:16:17,315 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3150 transitions. Word has length 335 [2019-11-23 21:16:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:17,315 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3150 transitions. [2019-11-23 21:16:17,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 21:16:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3150 transitions. [2019-11-23 21:16:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-23 21:16:17,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:17,323 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:17,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 989060, now seen corresponding path program 1 times [2019-11-23 21:16:17,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:17,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655808835] [2019-11-23 21:16:17,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655808835] [2019-11-23 21:16:18,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573289508] [2019-11-23 21:16:18,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:18,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:18,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 21:16:18,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:18,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-23 21:16:18,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112281533] [2019-11-23 21:16:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:18,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:18,652 INFO L87 Difference]: Start difference. First operand 2472 states and 3150 transitions. Second operand 3 states. [2019-11-23 21:16:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:20,985 INFO L93 Difference]: Finished difference Result 5243 states and 6655 transitions. [2019-11-23 21:16:20,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:20,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-23 21:16:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:20,999 INFO L225 Difference]: With dead ends: 5243 [2019-11-23 21:16:20,999 INFO L226 Difference]: Without dead ends: 2773 [2019-11-23 21:16:21,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 409 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2019-11-23 21:16:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2771. [2019-11-23 21:16:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2019-11-23 21:16:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3297 transitions. [2019-11-23 21:16:21,049 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3297 transitions. Word has length 409 [2019-11-23 21:16:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:21,050 INFO L462 AbstractCegarLoop]: Abstraction has 2771 states and 3297 transitions. [2019-11-23 21:16:21,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3297 transitions. [2019-11-23 21:16:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-11-23 21:16:21,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:21,059 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:21,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:21,263 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:21,263 INFO L82 PathProgramCache]: Analyzing trace with hash -79594870, now seen corresponding path program 1 times [2019-11-23 21:16:21,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:21,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73048754] [2019-11-23 21:16:21,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-23 21:16:21,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73048754] [2019-11-23 21:16:21,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:21,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 21:16:21,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688042540] [2019-11-23 21:16:21,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 21:16:21,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 21:16:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 21:16:21,586 INFO L87 Difference]: Start difference. First operand 2771 states and 3297 transitions. Second operand 4 states. [2019-11-23 21:16:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:25,132 INFO L93 Difference]: Finished difference Result 6744 states and 8302 transitions. [2019-11-23 21:16:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 21:16:25,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2019-11-23 21:16:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:25,150 INFO L225 Difference]: With dead ends: 6744 [2019-11-23 21:16:25,150 INFO L226 Difference]: Without dead ends: 3975 [2019-11-23 21:16:25,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 21:16:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-23 21:16:25,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3974. [2019-11-23 21:16:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-11-23 21:16:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 4762 transitions. [2019-11-23 21:16:25,215 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 4762 transitions. Word has length 426 [2019-11-23 21:16:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:25,215 INFO L462 AbstractCegarLoop]: Abstraction has 3974 states and 4762 transitions. [2019-11-23 21:16:25,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 21:16:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 4762 transitions. [2019-11-23 21:16:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-11-23 21:16:25,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:25,227 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:25,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1022697565, now seen corresponding path program 1 times [2019-11-23 21:16:25,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:25,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511624248] [2019-11-23 21:16:25,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-23 21:16:25,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511624248] [2019-11-23 21:16:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777863464] [2019-11-23 21:16:25,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:25,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:25,758 INFO L87 Difference]: Start difference. First operand 3974 states and 4762 transitions. Second operand 3 states. [2019-11-23 21:16:28,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:28,398 INFO L93 Difference]: Finished difference Result 9739 states and 11910 transitions. [2019-11-23 21:16:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:28,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2019-11-23 21:16:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:28,421 INFO L225 Difference]: With dead ends: 9739 [2019-11-23 21:16:28,421 INFO L226 Difference]: Without dead ends: 5767 [2019-11-23 21:16:28,426 INFO L630 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-11-23 21:16:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-23 21:16:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-23 21:16:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-23 21:16:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6998 transitions. [2019-11-23 21:16:28,510 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6998 transitions. Word has length 522 [2019-11-23 21:16:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:28,511 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6998 transitions. [2019-11-23 21:16:28,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6998 transitions. [2019-11-23 21:16:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-11-23 21:16:28,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:28,519 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:28,519 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:28,520 INFO L82 PathProgramCache]: Analyzing trace with hash -935582361, now seen corresponding path program 1 times [2019-11-23 21:16:28,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:28,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250651145] [2019-11-23 21:16:28,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 644 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-23 21:16:30,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250651145] [2019-11-23 21:16:30,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698999626] [2019-11-23 21:16:30,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:30,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-23 21:16:30,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:30,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-23 21:16:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-23 21:16:30,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 21:16:30,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-23 21:16:30,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322244183] [2019-11-23 21:16:30,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 21:16:30,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 21:16:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:30,977 INFO L87 Difference]: Start difference. First operand 5767 states and 6998 transitions. Second operand 9 states. [2019-11-23 21:16:40,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:40,388 INFO L93 Difference]: Finished difference Result 16172 states and 19332 transitions. [2019-11-23 21:16:40,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 21:16:40,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 613 [2019-11-23 21:16:40,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:40,415 INFO L225 Difference]: With dead ends: 16172 [2019-11-23 21:16:40,415 INFO L226 Difference]: Without dead ends: 7560 [2019-11-23 21:16:40,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 611 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-23 21:16:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2019-11-23 21:16:40,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 5466. [2019-11-23 21:16:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-23 21:16:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 5988 transitions. [2019-11-23 21:16:40,506 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 5988 transitions. Word has length 613 [2019-11-23 21:16:40,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:40,507 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 5988 transitions. [2019-11-23 21:16:40,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 21:16:40,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 5988 transitions. [2019-11-23 21:16:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-11-23 21:16:40,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:40,517 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:40,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:40,723 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1919446783, now seen corresponding path program 1 times [2019-11-23 21:16:40,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:40,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871348773] [2019-11-23 21:16:40,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-11-23 21:16:41,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871348773] [2019-11-23 21:16:41,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:41,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:41,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85641483] [2019-11-23 21:16:41,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:41,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:41,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:41,368 INFO L87 Difference]: Start difference. First operand 5466 states and 5988 transitions. Second operand 3 states. [2019-11-23 21:16:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:42,758 INFO L93 Difference]: Finished difference Result 10928 states and 11972 transitions. [2019-11-23 21:16:42,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:42,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 655 [2019-11-23 21:16:42,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:42,769 INFO L225 Difference]: With dead ends: 10928 [2019-11-23 21:16:42,769 INFO L226 Difference]: Without dead ends: 5464 [2019-11-23 21:16:42,774 INFO L630 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-11-23 21:16:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-11-23 21:16:42,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5464. [2019-11-23 21:16:42,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5464 states. [2019-11-23 21:16:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 5984 transitions. [2019-11-23 21:16:42,833 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 5984 transitions. Word has length 655 [2019-11-23 21:16:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:42,834 INFO L462 AbstractCegarLoop]: Abstraction has 5464 states and 5984 transitions. [2019-11-23 21:16:42,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 5984 transitions. [2019-11-23 21:16:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-11-23 21:16:42,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:42,842 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 21:16:42,843 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 967619704, now seen corresponding path program 1 times [2019-11-23 21:16:42,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:42,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702417890] [2019-11-23 21:16:42,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 493 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-23 21:16:44,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702417890] [2019-11-23 21:16:44,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031895368] [2019-11-23 21:16:44,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:44,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:44,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-23 21:16:44,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:44,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-23 21:16:44,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476041223] [2019-11-23 21:16:44,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:44,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:44,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:44,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:44,576 INFO L87 Difference]: Start difference. First operand 5464 states and 5984 transitions. Second operand 3 states. [2019-11-23 21:16:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:45,869 INFO L93 Difference]: Finished difference Result 10927 states and 11968 transitions. [2019-11-23 21:16:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:45,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 668 [2019-11-23 21:16:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:45,881 INFO L225 Difference]: With dead ends: 10927 [2019-11-23 21:16:45,881 INFO L226 Difference]: Without dead ends: 5465 [2019-11-23 21:16:45,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 669 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 21:16:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-11-23 21:16:45,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5462. [2019-11-23 21:16:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5462 states. [2019-11-23 21:16:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 5897 transitions. [2019-11-23 21:16:45,957 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 5897 transitions. Word has length 668 [2019-11-23 21:16:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:45,958 INFO L462 AbstractCegarLoop]: Abstraction has 5462 states and 5897 transitions. [2019-11-23 21:16:45,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 5897 transitions. [2019-11-23 21:16:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-23 21:16:45,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:45,968 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11-23 21:16:46,172 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:46,173 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1941988686, now seen corresponding path program 1 times [2019-11-23 21:16:46,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:46,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215391354] [2019-11-23 21:16:46,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 465 proven. 56 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:16:46,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215391354] [2019-11-23 21:16:46,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370910121] [2019-11-23 21:16:46,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:47,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:47,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-11-23 21:16:47,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:47,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-23 21:16:47,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719966945] [2019-11-23 21:16:47,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:47,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:47,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:47,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:16:47,629 INFO L87 Difference]: Start difference. First operand 5462 states and 5897 transitions. Second operand 3 states. [2019-11-23 21:16:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:50,190 INFO L93 Difference]: Finished difference Result 14217 states and 15297 transitions. [2019-11-23 21:16:50,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:50,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-23 21:16:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:50,205 INFO L225 Difference]: With dead ends: 14217 [2019-11-23 21:16:50,205 INFO L226 Difference]: Without dead ends: 8458 [2019-11-23 21:16:50,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-23 21:16:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2019-11-23 21:16:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 7854. [2019-11-23 21:16:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-11-23 21:16:50,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 8362 transitions. [2019-11-23 21:16:50,316 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 8362 transitions. Word has length 683 [2019-11-23 21:16:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:50,317 INFO L462 AbstractCegarLoop]: Abstraction has 7854 states and 8362 transitions. [2019-11-23 21:16:50,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 8362 transitions. [2019-11-23 21:16:50,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-11-23 21:16:50,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:50,339 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-11-23 21:16:50,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:50,543 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:50,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:50,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1940770496, now seen corresponding path program 1 times [2019-11-23 21:16:50,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:50,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175619708] [2019-11-23 21:16:50,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 487 proven. 56 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-23 21:16:51,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175619708] [2019-11-23 21:16:51,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486208840] [2019-11-23 21:16:51,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:51,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 21:16:51,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:16:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:51,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:16:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-23 21:16:52,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:16:52,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-23 21:16:52,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826702505] [2019-11-23 21:16:52,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:52,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:52,053 INFO L87 Difference]: Start difference. First operand 7854 states and 8362 transitions. Second operand 3 states. [2019-11-23 21:16:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:53,311 INFO L93 Difference]: Finished difference Result 15067 states and 15962 transitions. [2019-11-23 21:16:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:53,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 724 [2019-11-23 21:16:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:53,326 INFO L225 Difference]: With dead ends: 15067 [2019-11-23 21:16:53,326 INFO L226 Difference]: Without dead ends: 6916 [2019-11-23 21:16:53,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 724 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 21:16:53,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2019-11-23 21:16:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6019. [2019-11-23 21:16:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6019 states. [2019-11-23 21:16:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6019 states to 6019 states and 6277 transitions. [2019-11-23 21:16:53,396 INFO L78 Accepts]: Start accepts. Automaton has 6019 states and 6277 transitions. Word has length 724 [2019-11-23 21:16:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:53,397 INFO L462 AbstractCegarLoop]: Abstraction has 6019 states and 6277 transitions. [2019-11-23 21:16:53,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6019 states and 6277 transitions. [2019-11-23 21:16:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-11-23 21:16:53,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:53,413 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:53,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:16:53,617 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:53,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:53,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1877579581, now seen corresponding path program 1 times [2019-11-23 21:16:53,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:53,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611010121] [2019-11-23 21:16:53,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-23 21:16:54,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611010121] [2019-11-23 21:16:54,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:54,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:54,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698223233] [2019-11-23 21:16:54,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:54,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:54,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:54,461 INFO L87 Difference]: Start difference. First operand 6019 states and 6277 transitions. Second operand 3 states. [2019-11-23 21:16:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:55,756 INFO L93 Difference]: Finished difference Result 15024 states and 15707 transitions. [2019-11-23 21:16:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:16:55,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 900 [2019-11-23 21:16:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:55,767 INFO L225 Difference]: With dead ends: 15024 [2019-11-23 21:16:55,767 INFO L226 Difference]: Without dead ends: 9306 [2019-11-23 21:16:55,774 INFO L630 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-11-23 21:16:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9306 states. [2019-11-23 21:16:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9306 to 7811. [2019-11-23 21:16:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7811 states. [2019-11-23 21:16:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 8113 transitions. [2019-11-23 21:16:55,877 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 8113 transitions. Word has length 900 [2019-11-23 21:16:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:55,877 INFO L462 AbstractCegarLoop]: Abstraction has 7811 states and 8113 transitions. [2019-11-23 21:16:55,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:16:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 8113 transitions. [2019-11-23 21:16:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2019-11-23 21:16:55,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:55,894 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:55,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1055601463, now seen corresponding path program 1 times [2019-11-23 21:16:55,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:55,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496317492] [2019-11-23 21:16:55,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 982 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-11-23 21:16:57,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496317492] [2019-11-23 21:16:57,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:57,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 21:16:57,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353947303] [2019-11-23 21:16:57,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 21:16:57,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:57,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 21:16:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:16:57,205 INFO L87 Difference]: Start difference. First operand 7811 states and 8113 transitions. Second operand 6 states. [2019-11-23 21:16:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:16:59,037 INFO L93 Difference]: Finished difference Result 15401 states and 16003 transitions. [2019-11-23 21:16:59,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 21:16:59,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 907 [2019-11-23 21:16:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:16:59,047 INFO L225 Difference]: With dead ends: 15401 [2019-11-23 21:16:59,047 INFO L226 Difference]: Without dead ends: 7891 [2019-11-23 21:16:59,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 21:16:59,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-11-23 21:16:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7811. [2019-11-23 21:16:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7811 states. [2019-11-23 21:16:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 8057 transitions. [2019-11-23 21:16:59,128 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 8057 transitions. Word has length 907 [2019-11-23 21:16:59,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:16:59,129 INFO L462 AbstractCegarLoop]: Abstraction has 7811 states and 8057 transitions. [2019-11-23 21:16:59,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 21:16:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 8057 transitions. [2019-11-23 21:16:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2019-11-23 21:16:59,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:16:59,145 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:16:59,146 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:16:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:16:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1552580489, now seen corresponding path program 1 times [2019-11-23 21:16:59,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:16:59,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399849977] [2019-11-23 21:16:59,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:16:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:16:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-23 21:16:59,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399849977] [2019-11-23 21:16:59,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 21:16:59,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 21:16:59,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466783584] [2019-11-23 21:16:59,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:16:59,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:16:59,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:16:59,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 21:16:59,842 INFO L87 Difference]: Start difference. First operand 7811 states and 8057 transitions. Second operand 3 states. [2019-11-23 21:17:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:01,098 INFO L93 Difference]: Finished difference Result 18019 states and 18611 transitions. [2019-11-23 21:17:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 914 [2019-11-23 21:17:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:01,109 INFO L225 Difference]: With dead ends: 18019 [2019-11-23 21:17:01,110 INFO L226 Difference]: Without dead ends: 10509 [2019-11-23 21:17:01,116 INFO L630 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-11-23 21:17:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10509 states. [2019-11-23 21:17:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10509 to 9904. [2019-11-23 21:17:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9904 states. [2019-11-23 21:17:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 10218 transitions. [2019-11-23 21:17:01,193 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 10218 transitions. Word has length 914 [2019-11-23 21:17:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:01,194 INFO L462 AbstractCegarLoop]: Abstraction has 9904 states and 10218 transitions. [2019-11-23 21:17:01,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 10218 transitions. [2019-11-23 21:17:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2019-11-23 21:17:01,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 21:17:01,211 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 21:17:01,212 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 21:17:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 21:17:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -173843330, now seen corresponding path program 1 times [2019-11-23 21:17:01,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 21:17:01,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088270272] [2019-11-23 21:17:01,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 21:17:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 828 proven. 56 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-11-23 21:17:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088270272] [2019-11-23 21:17:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946382324] [2019-11-23 21:17:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 21:17:02,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 21:17:02,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 21:17:02,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:02,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-23 21:17:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2019-11-23 21:17:04,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 21:17:04,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-23 21:17:04,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261129643] [2019-11-23 21:17:04,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 21:17:04,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 21:17:04,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 21:17:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:17:04,393 INFO L87 Difference]: Start difference. First operand 9904 states and 10218 transitions. Second operand 3 states. [2019-11-23 21:17:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 21:17:06,447 INFO L93 Difference]: Finished difference Result 11105 states and 11446 transitions. [2019-11-23 21:17:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 21:17:06,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 990 [2019-11-23 21:17:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 21:17:06,449 INFO L225 Difference]: With dead ends: 11105 [2019-11-23 21:17:06,449 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 21:17:06,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 990 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-23 21:17:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 21:17:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 21:17:06,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 21:17:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 21:17:06,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 990 [2019-11-23 21:17:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 21:17:06,456 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 21:17:06,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 21:17:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 21:17:06,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 21:17:06,660 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 21:17:06,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 21:17:06,954 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 208 [2019-11-23 21:17:07,307 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 207 [2019-11-23 21:17:07,496 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 162 [2019-11-23 21:17:08,863 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 199 DAG size of output: 90