java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:55:50,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:55:50,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:55:50,078 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:55:50,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:55:50,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:55:50,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:55:50,083 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:55:50,085 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:55:50,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:55:50,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:55:50,087 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:55:50,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:55:50,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:55:50,090 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:55:50,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:55:50,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:55:50,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:55:50,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:55:50,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:55:50,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:55:50,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:55:50,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:55:50,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:55:50,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:55:50,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:55:50,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:55:50,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:55:50,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:55:50,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:55:50,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:55:50,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:55:50,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:55:50,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:55:50,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:55:50,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:55:50,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 14:55:50,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:55:50,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:55:50,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:55:50,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:55:50,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:55:50,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:55:50,132 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:55:50,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:55:50,134 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:55:50,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:55:50,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:55:50,135 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:55:50,135 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:55:50,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:55:50,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:55:50,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:55:50,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:55:50,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:55:50,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:55:50,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:55:50,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:55:50,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:55:50,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:55:50,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:55:50,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:55:50,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:55:50,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:55:50,138 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:55:50,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:55:50,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:55:50,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:55:50,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:55:50,243 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:55:50,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-24 14:55:50,313 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a3a3c2e7e/ec4f600f2f92485897fc4dd97ea4b4f4/FLAG53217ce2c [2018-10-24 14:55:51,070 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:55:51,071 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-10-24 14:55:51,089 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a3a3c2e7e/ec4f600f2f92485897fc4dd97ea4b4f4/FLAG53217ce2c [2018-10-24 14:55:51,103 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/a3a3c2e7e/ec4f600f2f92485897fc4dd97ea4b4f4 [2018-10-24 14:55:51,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:55:51,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:55:51,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:55:51,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:55:51,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:55:51,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:55:51" (1/1) ... [2018-10-24 14:55:51,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b295a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:51, skipping insertion in model container [2018-10-24 14:55:51,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:55:51" (1/1) ... [2018-10-24 14:55:51,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:55:51,231 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:55:52,059 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:55:52,065 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:55:52,349 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:55:52,374 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:55:52,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52 WrapperNode [2018-10-24 14:55:52,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:55:52,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:55:52,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:55:52,376 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:55:52,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:55:52,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:55:52,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:55:52,732 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:55:52,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... [2018-10-24 14:55:52,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:55:52,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:55:52,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:55:52,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:55:52,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 14:55:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:55:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:55:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:55:58,631 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:55:58,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:55:58 BoogieIcfgContainer [2018-10-24 14:55:58,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:55:58,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:55:58,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:55:58,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:55:58,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:55:51" (1/3) ... [2018-10-24 14:55:58,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4e2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:55:58, skipping insertion in model container [2018-10-24 14:55:58,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:55:52" (2/3) ... [2018-10-24 14:55:58,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c4e2f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:55:58, skipping insertion in model container [2018-10-24 14:55:58,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:55:58" (3/3) ... [2018-10-24 14:55:58,641 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label16_true-unreach-call.c [2018-10-24 14:55:58,652 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:55:58,661 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:55:58,680 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:55:58,718 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:55:58,719 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:55:58,719 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:55:58,719 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:55:58,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:55:58,720 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:55:58,720 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:55:58,720 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:55:58,720 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:55:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 14:55:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-24 14:55:58,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:55:58,773 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:55:58,777 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:55:58,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:55:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1181546316, now seen corresponding path program 1 times [2018-10-24 14:55:58,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:55:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:55:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:55:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:55:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:55:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:55:59,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:55:59,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:55:59,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:55:59,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:55:59,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:55:59,721 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 14:56:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:03,270 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-10-24 14:56:03,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:03,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-10-24 14:56:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:03,301 INFO L225 Difference]: With dead ends: 1075 [2018-10-24 14:56:03,301 INFO L226 Difference]: Without dead ends: 765 [2018-10-24 14:56:03,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-10-24 14:56:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-10-24 14:56:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-24 14:56:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-10-24 14:56:03,394 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 166 [2018-10-24 14:56:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:03,395 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-10-24 14:56:03,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-10-24 14:56:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 14:56:03,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:03,406 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 14:56:03,406 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:03,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:03,407 INFO L82 PathProgramCache]: Analyzing trace with hash 857919243, now seen corresponding path program 1 times [2018-10-24 14:56:03,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:03,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:03,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:56:03,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:03,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:56:03,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:03,635 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-10-24 14:56:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:05,775 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-10-24 14:56:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:05,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-10-24 14:56:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:05,782 INFO L225 Difference]: With dead ends: 1465 [2018-10-24 14:56:05,782 INFO L226 Difference]: Without dead ends: 947 [2018-10-24 14:56:05,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-10-24 14:56:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-10-24 14:56:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-10-24 14:56:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-10-24 14:56:05,866 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 175 [2018-10-24 14:56:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:05,867 INFO L481 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-10-24 14:56:05,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-10-24 14:56:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-24 14:56:05,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:05,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:05,875 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:05,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:05,876 INFO L82 PathProgramCache]: Analyzing trace with hash 954136543, now seen corresponding path program 1 times [2018-10-24 14:56:05,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:05,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:05,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:05,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:06,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:06,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:06,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:06,232 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-10-24 14:56:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:10,512 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-10-24 14:56:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:10,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-10-24 14:56:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:10,524 INFO L225 Difference]: With dead ends: 2693 [2018-10-24 14:56:10,524 INFO L226 Difference]: Without dead ends: 1764 [2018-10-24 14:56:10,527 INFO L605 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 [2018-10-24 14:56:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-10-24 14:56:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-10-24 14:56:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-10-24 14:56:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-10-24 14:56:10,570 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 183 [2018-10-24 14:56:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:10,571 INFO L481 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-10-24 14:56:10,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-10-24 14:56:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-24 14:56:10,576 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:10,576 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2018-10-24 14:56:10,577 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:10,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454467, now seen corresponding path program 1 times [2018-10-24 14:56:10,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:10,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:10,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:10,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:10,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:10,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:10,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:10,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:10,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:10,700 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-10-24 14:56:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:12,136 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-10-24 14:56:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:12,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-10-24 14:56:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:12,157 INFO L225 Difference]: With dead ends: 5132 [2018-10-24 14:56:12,157 INFO L226 Difference]: Without dead ends: 3386 [2018-10-24 14:56:12,162 INFO L605 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 [2018-10-24 14:56:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-10-24 14:56:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-10-24 14:56:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-24 14:56:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-10-24 14:56:12,250 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 190 [2018-10-24 14:56:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:12,251 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-10-24 14:56:12,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-10-24 14:56:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:56:12,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:12,262 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 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] [2018-10-24 14:56:12,263 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:12,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:12,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1025659639, now seen corresponding path program 1 times [2018-10-24 14:56:12,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:12,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:12,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:12,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:12,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-24 14:56:12,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:12,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:12,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:12,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:12,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:12,451 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-10-24 14:56:14,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:14,111 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-10-24 14:56:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:14,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-10-24 14:56:14,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:14,150 INFO L225 Difference]: With dead ends: 10035 [2018-10-24 14:56:14,150 INFO L226 Difference]: Without dead ends: 6652 [2018-10-24 14:56:14,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-10-24 14:56:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-10-24 14:56:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:56:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-10-24 14:56:14,289 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 197 [2018-10-24 14:56:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:14,289 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-10-24 14:56:14,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-10-24 14:56:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:56:14,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:14,304 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:14,304 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:14,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2138090957, now seen corresponding path program 1 times [2018-10-24 14:56:14,305 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:14,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:14,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:56:14,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:14,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:14,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:14,595 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-10-24 14:56:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:17,273 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-10-24 14:56:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:17,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-24 14:56:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:17,296 INFO L225 Difference]: With dead ends: 13297 [2018-10-24 14:56:17,297 INFO L226 Difference]: Without dead ends: 6650 [2018-10-24 14:56:17,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-10-24 14:56:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-10-24 14:56:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-10-24 14:56:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-10-24 14:56:17,413 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 197 [2018-10-24 14:56:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:17,414 INFO L481 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-10-24 14:56:17,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:17,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-10-24 14:56:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-24 14:56:17,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:17,430 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:17,430 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:17,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 253101429, now seen corresponding path program 1 times [2018-10-24 14:56:17,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:17,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-24 14:56:17,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:17,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:56:17,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:17,604 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-10-24 14:56:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:18,460 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-10-24 14:56:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:18,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-10-24 14:56:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:18,487 INFO L225 Difference]: With dead ends: 13264 [2018-10-24 14:56:18,487 INFO L226 Difference]: Without dead ends: 6617 [2018-10-24 14:56:18,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-10-24 14:56:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-10-24 14:56:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-10-24 14:56:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-10-24 14:56:18,594 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-10-24 14:56:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:18,594 INFO L481 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-10-24 14:56:18,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-10-24 14:56:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-24 14:56:18,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:18,608 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:18,608 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:18,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:18,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1785953004, now seen corresponding path program 1 times [2018-10-24 14:56:18,609 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:18,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:18,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:18,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:18,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:18,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:18,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:18,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:18,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:18,773 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-10-24 14:56:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:20,103 INFO L93 Difference]: Finished difference Result 15882 states and 19789 transitions. [2018-10-24 14:56:20,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:20,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-10-24 14:56:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:20,153 INFO L225 Difference]: With dead ends: 15882 [2018-10-24 14:56:20,153 INFO L226 Difference]: Without dead ends: 9267 [2018-10-24 14:56:20,163 INFO L605 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 [2018-10-24 14:56:20,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9267 states. [2018-10-24 14:56:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9267 to 9267. [2018-10-24 14:56:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2018-10-24 14:56:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 10892 transitions. [2018-10-24 14:56:20,389 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 10892 transitions. Word has length 222 [2018-10-24 14:56:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:20,389 INFO L481 AbstractCegarLoop]: Abstraction has 9267 states and 10892 transitions. [2018-10-24 14:56:20,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 10892 transitions. [2018-10-24 14:56:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-24 14:56:20,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:20,408 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:20,408 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:20,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 324309577, now seen corresponding path program 1 times [2018-10-24 14:56:20,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:20,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:20,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:20,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 14:56:20,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:20,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:20,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:20,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:20,607 INFO L87 Difference]: Start difference. First operand 9267 states and 10892 transitions. Second operand 3 states. [2018-10-24 14:56:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:22,073 INFO L93 Difference]: Finished difference Result 26494 states and 31046 transitions. [2018-10-24 14:56:22,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:22,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-10-24 14:56:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:22,107 INFO L225 Difference]: With dead ends: 26494 [2018-10-24 14:56:22,108 INFO L226 Difference]: Without dead ends: 17229 [2018-10-24 14:56:22,121 INFO L605 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 [2018-10-24 14:56:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2018-10-24 14:56:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 17225. [2018-10-24 14:56:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-24 14:56:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19750 transitions. [2018-10-24 14:56:22,338 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19750 transitions. Word has length 249 [2018-10-24 14:56:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:22,338 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19750 transitions. [2018-10-24 14:56:22,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19750 transitions. [2018-10-24 14:56:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-24 14:56:22,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:22,358 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:22,358 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:22,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 585273194, now seen corresponding path program 1 times [2018-10-24 14:56:22,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:22,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-24 14:56:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:22,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:22,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:22,600 INFO L87 Difference]: Start difference. First operand 17225 states and 19750 transitions. Second operand 4 states. [2018-10-24 14:56:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:24,396 INFO L93 Difference]: Finished difference Result 34456 states and 39512 transitions. [2018-10-24 14:56:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:24,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-10-24 14:56:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:24,424 INFO L225 Difference]: With dead ends: 34456 [2018-10-24 14:56:24,424 INFO L226 Difference]: Without dead ends: 17233 [2018-10-24 14:56:24,442 INFO L605 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 [2018-10-24 14:56:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2018-10-24 14:56:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17225. [2018-10-24 14:56:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-10-24 14:56:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19548 transitions. [2018-10-24 14:56:24,660 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19548 transitions. Word has length 256 [2018-10-24 14:56:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:24,661 INFO L481 AbstractCegarLoop]: Abstraction has 17225 states and 19548 transitions. [2018-10-24 14:56:24,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:24,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19548 transitions. [2018-10-24 14:56:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-24 14:56:24,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:24,682 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:24,682 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:24,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash -491815230, now seen corresponding path program 1 times [2018-10-24 14:56:24,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:24,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:24,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:25,394 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 14:56:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-24 14:56:25,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:25,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:56:25,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:56:25,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:56:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:56:25,557 INFO L87 Difference]: Start difference. First operand 17225 states and 19548 transitions. Second operand 5 states. [2018-10-24 14:56:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:28,217 INFO L93 Difference]: Finished difference Result 52673 states and 59425 transitions. [2018-10-24 14:56:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:56:28,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-10-24 14:56:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:28,269 INFO L225 Difference]: With dead ends: 52673 [2018-10-24 14:56:28,270 INFO L226 Difference]: Without dead ends: 35450 [2018-10-24 14:56:28,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:56:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35450 states. [2018-10-24 14:56:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35450 to 35445. [2018-10-24 14:56:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35445 states. [2018-10-24 14:56:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35445 states to 35445 states and 39830 transitions. [2018-10-24 14:56:28,793 INFO L78 Accepts]: Start accepts. Automaton has 35445 states and 39830 transitions. Word has length 269 [2018-10-24 14:56:28,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:28,793 INFO L481 AbstractCegarLoop]: Abstraction has 35445 states and 39830 transitions. [2018-10-24 14:56:28,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:56:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35445 states and 39830 transitions. [2018-10-24 14:56:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-24 14:56:28,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:28,822 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:28,823 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:28,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -517916135, now seen corresponding path program 1 times [2018-10-24 14:56:28,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:28,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:28,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:29,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:29,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:29,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:29,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:29,177 INFO L87 Difference]: Start difference. First operand 35445 states and 39830 transitions. Second operand 4 states. [2018-10-24 14:56:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:31,599 INFO L93 Difference]: Finished difference Result 73150 states and 82339 transitions. [2018-10-24 14:56:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:31,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-10-24 14:56:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:31,647 INFO L225 Difference]: With dead ends: 73150 [2018-10-24 14:56:31,647 INFO L226 Difference]: Without dead ends: 37707 [2018-10-24 14:56:31,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37707 states. [2018-10-24 14:56:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37707 to 37695. [2018-10-24 14:56:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-24 14:56:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 42345 transitions. [2018-10-24 14:56:32,127 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 42345 transitions. Word has length 277 [2018-10-24 14:56:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:32,127 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 42345 transitions. [2018-10-24 14:56:32,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 42345 transitions. [2018-10-24 14:56:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-24 14:56:32,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:32,142 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-24 14:56:32,142 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:32,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:32,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1028863245, now seen corresponding path program 1 times [2018-10-24 14:56:32,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:32,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:32,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:32,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:32,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:32,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:32,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:32,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:32,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:32,561 INFO L87 Difference]: Start difference. First operand 37695 states and 42345 transitions. Second operand 4 states. [2018-10-24 14:56:34,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:34,364 INFO L93 Difference]: Finished difference Result 75399 states and 84709 transitions. [2018-10-24 14:56:34,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:34,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-10-24 14:56:34,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:34,407 INFO L225 Difference]: With dead ends: 75399 [2018-10-24 14:56:34,407 INFO L226 Difference]: Without dead ends: 37706 [2018-10-24 14:56:34,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37706 states. [2018-10-24 14:56:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37706 to 37695. [2018-10-24 14:56:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-10-24 14:56:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 41937 transitions. [2018-10-24 14:56:34,800 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 41937 transitions. Word has length 278 [2018-10-24 14:56:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:34,801 INFO L481 AbstractCegarLoop]: Abstraction has 37695 states and 41937 transitions. [2018-10-24 14:56:34,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 41937 transitions. [2018-10-24 14:56:34,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-24 14:56:34,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:34,813 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:34,814 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:34,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:34,814 INFO L82 PathProgramCache]: Analyzing trace with hash -929080328, now seen corresponding path program 1 times [2018-10-24 14:56:34,814 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:34,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:34,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:34,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:34,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:56:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:35,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:35,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:35,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:35,145 INFO L87 Difference]: Start difference. First operand 37695 states and 41937 transitions. Second operand 3 states. [2018-10-24 14:56:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:36,929 INFO L93 Difference]: Finished difference Result 73343 states and 81685 transitions. [2018-10-24 14:56:36,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:36,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-10-24 14:56:36,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:36,976 INFO L225 Difference]: With dead ends: 73343 [2018-10-24 14:56:36,977 INFO L226 Difference]: Without dead ends: 35650 [2018-10-24 14:56:37,003 INFO L605 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 [2018-10-24 14:56:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35650 states. [2018-10-24 14:56:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35650 to 35647. [2018-10-24 14:56:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35647 states. [2018-10-24 14:56:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35647 states to 35647 states and 38821 transitions. [2018-10-24 14:56:37,380 INFO L78 Accepts]: Start accepts. Automaton has 35647 states and 38821 transitions. Word has length 294 [2018-10-24 14:56:37,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:37,381 INFO L481 AbstractCegarLoop]: Abstraction has 35647 states and 38821 transitions. [2018-10-24 14:56:37,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 35647 states and 38821 transitions. [2018-10-24 14:56:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-24 14:56:37,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:37,393 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:37,393 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:37,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash 896536754, now seen corresponding path program 1 times [2018-10-24 14:56:37,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:37,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:37,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:37,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:56:37,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:37,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:37,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:37,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:37,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:37,871 INFO L87 Difference]: Start difference. First operand 35647 states and 38821 transitions. Second operand 4 states. [2018-10-24 14:56:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:38,914 INFO L93 Difference]: Finished difference Result 135836 states and 147858 transitions. [2018-10-24 14:56:38,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:38,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2018-10-24 14:56:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:39,028 INFO L225 Difference]: With dead ends: 135836 [2018-10-24 14:56:39,029 INFO L226 Difference]: Without dead ends: 100191 [2018-10-24 14:56:39,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100191 states. [2018-10-24 14:56:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100191 to 64134. [2018-10-24 14:56:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64134 states. [2018-10-24 14:56:39,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64134 states to 64134 states and 69822 transitions. [2018-10-24 14:56:39,968 INFO L78 Accepts]: Start accepts. Automaton has 64134 states and 69822 transitions. Word has length 298 [2018-10-24 14:56:39,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:39,968 INFO L481 AbstractCegarLoop]: Abstraction has 64134 states and 69822 transitions. [2018-10-24 14:56:39,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:39,968 INFO L276 IsEmpty]: Start isEmpty. Operand 64134 states and 69822 transitions. [2018-10-24 14:56:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-24 14:56:39,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:39,988 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:56:39,988 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:39,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash 126833866, now seen corresponding path program 1 times [2018-10-24 14:56:39,989 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:39,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:39,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:39,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:39,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:56:40,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:40,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:56:40,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:56:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:56:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:40,293 INFO L87 Difference]: Start difference. First operand 64134 states and 69822 transitions. Second operand 3 states. [2018-10-24 14:56:42,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:42,219 INFO L93 Difference]: Finished difference Result 158805 states and 172541 transitions. [2018-10-24 14:56:42,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:56:42,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2018-10-24 14:56:42,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:42,314 INFO L225 Difference]: With dead ends: 158805 [2018-10-24 14:56:42,314 INFO L226 Difference]: Without dead ends: 94673 [2018-10-24 14:56:42,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:56:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94673 states. [2018-10-24 14:56:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94673 to 92616. [2018-10-24 14:56:43,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92616 states. [2018-10-24 14:56:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92616 states to 92616 states and 100489 transitions. [2018-10-24 14:56:43,275 INFO L78 Accepts]: Start accepts. Automaton has 92616 states and 100489 transitions. Word has length 318 [2018-10-24 14:56:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:43,275 INFO L481 AbstractCegarLoop]: Abstraction has 92616 states and 100489 transitions. [2018-10-24 14:56:43,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:56:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 92616 states and 100489 transitions. [2018-10-24 14:56:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-24 14:56:43,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:43,293 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:43,294 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:43,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:43,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1579485379, now seen corresponding path program 1 times [2018-10-24 14:56:43,294 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:43,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:43,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:43,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:43,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:56:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:56:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:56:43,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:56:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:56:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:43,792 INFO L87 Difference]: Start difference. First operand 92616 states and 100489 transitions. Second operand 4 states. [2018-10-24 14:56:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:46,574 INFO L93 Difference]: Finished difference Result 268198 states and 290902 transitions. [2018-10-24 14:56:46,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:56:46,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-10-24 14:56:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:46,761 INFO L225 Difference]: With dead ends: 268198 [2018-10-24 14:56:46,762 INFO L226 Difference]: Without dead ends: 170869 [2018-10-24 14:56:46,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:56:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170869 states. [2018-10-24 14:56:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170869 to 169432. [2018-10-24 14:56:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169432 states. [2018-10-24 14:56:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169432 states to 169432 states and 181761 transitions. [2018-10-24 14:56:48,386 INFO L78 Accepts]: Start accepts. Automaton has 169432 states and 181761 transitions. Word has length 320 [2018-10-24 14:56:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:56:48,387 INFO L481 AbstractCegarLoop]: Abstraction has 169432 states and 181761 transitions. [2018-10-24 14:56:48,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:56:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 169432 states and 181761 transitions. [2018-10-24 14:56:48,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-24 14:56:48,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:56:48,401 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 14:56:48,402 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:56:48,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:56:48,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1328338570, now seen corresponding path program 1 times [2018-10-24 14:56:48,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:56:48,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:56:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:48,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:48,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:56:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-10-24 14:56:48,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:56:48,675 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:56:48,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:56:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:56:48,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:56:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-24 14:56:49,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:56:49,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 14:56:49,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:56:49,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:56:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:56:49,047 INFO L87 Difference]: Start difference. First operand 169432 states and 181761 transitions. Second operand 6 states. [2018-10-24 14:56:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:56:57,884 INFO L93 Difference]: Finished difference Result 805370 states and 864039 transitions. [2018-10-24 14:56:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 14:56:57,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-10-24 14:56:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:56:58,689 INFO L225 Difference]: With dead ends: 805370 [2018-10-24 14:56:58,690 INFO L226 Difference]: Without dead ends: 635940 [2018-10-24 14:56:58,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:56:59,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635940 states. [2018-10-24 14:57:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635940 to 602296. [2018-10-24 14:57:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602296 states. [2018-10-24 14:57:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602296 states to 602296 states and 638430 transitions. [2018-10-24 14:57:19,035 INFO L78 Accepts]: Start accepts. Automaton has 602296 states and 638430 transitions. Word has length 326 [2018-10-24 14:57:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:57:19,035 INFO L481 AbstractCegarLoop]: Abstraction has 602296 states and 638430 transitions. [2018-10-24 14:57:19,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:57:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 602296 states and 638430 transitions. [2018-10-24 14:57:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-24 14:57:19,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:57:19,069 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:57:19,069 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:57:19,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:57:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -777036058, now seen corresponding path program 1 times [2018-10-24 14:57:19,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:57:19,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:57:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:19,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:19,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:57:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 32 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-24 14:57:19,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:57:19,464 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:57:19,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:57:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:57:19,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:57:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-10-24 14:57:19,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:57:19,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 14:57:19,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:57:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:57:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:19,779 INFO L87 Difference]: Start difference. First operand 602296 states and 638430 transitions. Second operand 4 states. [2018-10-24 14:57:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:57:32,286 INFO L93 Difference]: Finished difference Result 2002725 states and 2120342 transitions. [2018-10-24 14:57:32,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:57:32,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-10-24 14:57:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:57:34,360 INFO L225 Difference]: With dead ends: 2002725 [2018-10-24 14:57:34,360 INFO L226 Difference]: Without dead ends: 1400431 [2018-10-24 14:57:34,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:57:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400431 states. [2018-10-24 14:58:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400431 to 922658. [2018-10-24 14:58:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922658 states. [2018-10-24 14:58:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922658 states to 922658 states and 976476 transitions. [2018-10-24 14:58:05,917 INFO L78 Accepts]: Start accepts. Automaton has 922658 states and 976476 transitions. Word has length 378 [2018-10-24 14:58:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:05,917 INFO L481 AbstractCegarLoop]: Abstraction has 922658 states and 976476 transitions. [2018-10-24 14:58:05,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:58:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 922658 states and 976476 transitions. [2018-10-24 14:58:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-24 14:58:06,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:06,016 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:06,016 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:06,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1084773979, now seen corresponding path program 1 times [2018-10-24 14:58:06,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:06,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-24 14:58:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:58:08,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 14:58:08,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 14:58:08,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 14:58:08,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:08,371 INFO L87 Difference]: Start difference. First operand 922658 states and 976476 transitions. Second operand 5 states. [2018-10-24 14:58:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:58:20,813 INFO L93 Difference]: Finished difference Result 2030370 states and 2148031 transitions. [2018-10-24 14:58:20,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:58:20,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2018-10-24 14:58:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:58:22,420 INFO L225 Difference]: With dead ends: 2030370 [2018-10-24 14:58:22,421 INFO L226 Difference]: Without dead ends: 1107714 [2018-10-24 14:58:37,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:58:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107714 states. [2018-10-24 14:58:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107714 to 965836. [2018-10-24 14:58:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965836 states. [2018-10-24 14:58:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965836 states to 965836 states and 1025224 transitions. [2018-10-24 14:58:54,563 INFO L78 Accepts]: Start accepts. Automaton has 965836 states and 1025224 transitions. Word has length 388 [2018-10-24 14:58:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:58:54,563 INFO L481 AbstractCegarLoop]: Abstraction has 965836 states and 1025224 transitions. [2018-10-24 14:58:54,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 14:58:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 965836 states and 1025224 transitions. [2018-10-24 14:58:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-24 14:58:54,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:58:54,676 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:58:54,676 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:58:54,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:58:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash -380448547, now seen corresponding path program 1 times [2018-10-24 14:58:54,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:58:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:58:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:54,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:54,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:58:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:55,164 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 14:58:55,384 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 14:58:55,986 WARN L179 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-10-24 14:58:56,204 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-24 14:58:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-24 14:58:56,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:58:56,739 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 14:58:56,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:58:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:58:56,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:58:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-10-24 14:58:57,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:58:57,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-10-24 14:58:57,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 14:58:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 14:58:57,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-24 14:58:57,900 INFO L87 Difference]: Start difference. First operand 965836 states and 1025224 transitions. Second operand 10 states. [2018-10-24 14:58:58,581 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-24 14:59:01,629 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 19 Received shutdown request... [2018-10-24 14:59:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-24 14:59:05,268 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 14:59:05,275 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 14:59:05,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:59:05 BoogieIcfgContainer [2018-10-24 14:59:05,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:59:05,276 INFO L168 Benchmark]: Toolchain (without parser) took 194161.39 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -905.0 MB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,277 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:59:05,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1258.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 355.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -841.3 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,279 INFO L168 Benchmark]: Boogie Preprocessor took 153.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,280 INFO L168 Benchmark]: RCFGBuilder took 5747.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,281 INFO L168 Benchmark]: TraceAbstraction took 186641.40 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -419.7 MB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-10-24 14:59:05,291 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1258.11 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 355.60 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 717.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -841.3 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.15 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5747.75 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 257.1 MB). Peak memory consumption was 257.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186641.40 ms. Allocated memory was 2.2 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 2.3 GB in the end (delta: -419.7 MB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1530]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (965836states) and FLOYD_HOARE automaton (currently 12 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (5673 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.5s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 97.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5844 SDtfs, 11734 SDslu, 4157 SDs, 0 SdLazy, 21186 SolverSat, 3674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 43.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1217 GetRequests, 1158 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965836occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 75.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 693171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 6751 NumberOfCodeBlocks, 6751 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 6727 ConstructedInterpolants, 0 QuantifiedInterpolants, 6184669 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2011 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 24 InterpolantComputations, 21 PerfectInterpolantSequences, 4273/4364 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown