java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-df4b876 [2018-11-06 19:54:32,841 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:54:32,844 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:54:32,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:54:32,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:54:32,858 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:54:32,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:54:32,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:54:32,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:54:32,864 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:54:32,865 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:54:32,865 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:54:32,866 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:54:32,867 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:54:32,868 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:54:32,869 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:54:32,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:54:32,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:54:32,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:54:32,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:54:32,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:54:32,883 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:54:32,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:54:32,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:54:32,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:54:32,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:54:32,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:54:32,889 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:54:32,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:54:32,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:54:32,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:54:32,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:54:32,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:54:32,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:54:32,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:54:32,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:54:32,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:54:32,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:54:32,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:54:32,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:54:32,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:54:32,914 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:54:32,914 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:54:32,914 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:54:32,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:54:32,915 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:54:32,915 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:54:32,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:54:32,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:54:32,916 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:54:32,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:54:32,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:54:32,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:54:32,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:54:32,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:54:32,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:54:32,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:54:32,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:54:32,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:54:32,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:54:32,919 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:54:32,920 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:54:32,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:54:32,920 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:54:32,921 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:54:32,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:54:32,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:54:32,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:54:33,001 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:54:33,001 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:54:33,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-11-06 19:54:33,069 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f79931b3/ed6a35f388bc46549be74148ff972d7a/FLAG16487feb2 [2018-11-06 19:54:33,799 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:54:33,800 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16_true-unreach-call.c [2018-11-06 19:54:33,825 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f79931b3/ed6a35f388bc46549be74148ff972d7a/FLAG16487feb2 [2018-11-06 19:54:33,851 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f79931b3/ed6a35f388bc46549be74148ff972d7a [2018-11-06 19:54:33,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:54:33,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:54:33,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:54:33,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:54:33,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:54:33,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:54:33" (1/1) ... [2018-11-06 19:54:33,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f813bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:33, skipping insertion in model container [2018-11-06 19:54:33,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:54:33" (1/1) ... [2018-11-06 19:54:33,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:54:33,994 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:54:34,783 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:54:34,789 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:54:35,074 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:54:35,100 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:54:35,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35 WrapperNode [2018-11-06 19:54:35,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:54:35,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:54:35,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:54:35,103 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:54:35,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:54:35,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:54:35,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:54:35,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:54:35,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... [2018-11-06 19:54:35,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:54:35,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:54:35,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:54:35,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:54:35,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:54:35,641 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:54:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:54:35,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:54:40,938 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:54:40,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:54:40 BoogieIcfgContainer [2018-11-06 19:54:40,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:54:40,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:54:40,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:54:40,944 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:54:40,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:54:33" (1/3) ... [2018-11-06 19:54:40,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4471c7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:54:40, skipping insertion in model container [2018-11-06 19:54:40,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:54:35" (2/3) ... [2018-11-06 19:54:40,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4471c7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:54:40, skipping insertion in model container [2018-11-06 19:54:40,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:54:40" (3/3) ... [2018-11-06 19:54:40,948 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label16_true-unreach-call.c [2018-11-06 19:54:40,959 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:54:40,968 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:54:40,987 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:54:41,027 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:54:41,028 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:54:41,028 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:54:41,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:54:41,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:54:41,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:54:41,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:54:41,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:54:41,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:54:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:54:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-06 19:54:41,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:41,078 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-11-06 19:54:41,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:41,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1181546316, now seen corresponding path program 1 times [2018-11-06 19:54:41,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:41,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:41,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:54:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:42,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:42,037 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:54:45,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:45,515 INFO L93 Difference]: Finished difference Result 1075 states and 1921 transitions. [2018-11-06 19:54:45,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:54:45,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-11-06 19:54:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:45,544 INFO L225 Difference]: With dead ends: 1075 [2018-11-06 19:54:45,544 INFO L226 Difference]: Without dead ends: 765 [2018-11-06 19:54:45,550 INFO L604 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-11-06 19:54:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-11-06 19:54:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 520. [2018-11-06 19:54:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-11-06 19:54:45,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 853 transitions. [2018-11-06 19:54:45,635 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 853 transitions. Word has length 166 [2018-11-06 19:54:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:45,638 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 853 transitions. [2018-11-06 19:54:45,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 853 transitions. [2018-11-06 19:54:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-06 19:54:45,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:45,645 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-11-06 19:54:45,645 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash 857919243, now seen corresponding path program 1 times [2018-11-06 19:54:45,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:54:45,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:45,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:54:45,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:45,781 INFO L87 Difference]: Start difference. First operand 520 states and 853 transitions. Second operand 3 states. [2018-11-06 19:54:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:47,775 INFO L93 Difference]: Finished difference Result 1465 states and 2463 transitions. [2018-11-06 19:54:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:47,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-06 19:54:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:47,782 INFO L225 Difference]: With dead ends: 1465 [2018-11-06 19:54:47,782 INFO L226 Difference]: Without dead ends: 947 [2018-11-06 19:54:47,786 INFO L604 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-11-06 19:54:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2018-11-06 19:54:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 931. [2018-11-06 19:54:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2018-11-06 19:54:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1508 transitions. [2018-11-06 19:54:47,839 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1508 transitions. Word has length 175 [2018-11-06 19:54:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:47,840 INFO L480 AbstractCegarLoop]: Abstraction has 931 states and 1508 transitions. [2018-11-06 19:54:47,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1508 transitions. [2018-11-06 19:54:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-06 19:54:47,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:47,851 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-11-06 19:54:47,853 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:47,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 954136543, now seen corresponding path program 1 times [2018-11-06 19:54:47,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:47,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:54:48,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:48,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:48,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:48,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:48,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:48,181 INFO L87 Difference]: Start difference. First operand 931 states and 1508 transitions. Second operand 3 states. [2018-11-06 19:54:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:52,271 INFO L93 Difference]: Finished difference Result 2693 states and 4423 transitions. [2018-11-06 19:54:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:52,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2018-11-06 19:54:52,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:52,284 INFO L225 Difference]: With dead ends: 2693 [2018-11-06 19:54:52,284 INFO L226 Difference]: Without dead ends: 1764 [2018-11-06 19:54:52,287 INFO L604 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-11-06 19:54:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2018-11-06 19:54:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1748. [2018-11-06 19:54:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2018-11-06 19:54:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2752 transitions. [2018-11-06 19:54:52,327 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2752 transitions. Word has length 183 [2018-11-06 19:54:52,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:52,328 INFO L480 AbstractCegarLoop]: Abstraction has 1748 states and 2752 transitions. [2018-11-06 19:54:52,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:52,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2752 transitions. [2018-11-06 19:54:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-06 19:54:52,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:52,333 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-11-06 19:54:52,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:52,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1279454467, now seen corresponding path program 1 times [2018-11-06 19:54:52,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:54:52,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:52,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:52,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:52,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:52,462 INFO L87 Difference]: Start difference. First operand 1748 states and 2752 transitions. Second operand 3 states. [2018-11-06 19:54:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:53,975 INFO L93 Difference]: Finished difference Result 5132 states and 8130 transitions. [2018-11-06 19:54:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:53,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2018-11-06 19:54:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:53,996 INFO L225 Difference]: With dead ends: 5132 [2018-11-06 19:54:53,996 INFO L226 Difference]: Without dead ends: 3386 [2018-11-06 19:54:54,001 INFO L604 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-11-06 19:54:54,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-11-06 19:54:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3385. [2018-11-06 19:54:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-11-06 19:54:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4962 transitions. [2018-11-06 19:54:54,085 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4962 transitions. Word has length 190 [2018-11-06 19:54:54,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:54,085 INFO L480 AbstractCegarLoop]: Abstraction has 3385 states and 4962 transitions. [2018-11-06 19:54:54,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4962 transitions. [2018-11-06 19:54:54,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-06 19:54:54,095 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:54,095 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-11-06 19:54:54,096 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:54,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:54,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1025659639, now seen corresponding path program 1 times [2018-11-06 19:54:54,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:54,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:54,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:54,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:54,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:54:54,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:54,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:54,360 INFO L87 Difference]: Start difference. First operand 3385 states and 4962 transitions. Second operand 3 states. [2018-11-06 19:54:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:55,668 INFO L93 Difference]: Finished difference Result 10035 states and 14750 transitions. [2018-11-06 19:54:55,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:55,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2018-11-06 19:54:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:55,699 INFO L225 Difference]: With dead ends: 10035 [2018-11-06 19:54:55,700 INFO L226 Difference]: Without dead ends: 6652 [2018-11-06 19:54:55,707 INFO L604 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-11-06 19:54:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6652 states. [2018-11-06 19:54:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6652 to 6649. [2018-11-06 19:54:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:54:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8832 transitions. [2018-11-06 19:54:55,835 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8832 transitions. Word has length 197 [2018-11-06 19:54:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:55,836 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8832 transitions. [2018-11-06 19:54:55,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:54:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8832 transitions. [2018-11-06 19:54:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-06 19:54:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:55,850 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-11-06 19:54:55,850 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:55,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2138090957, now seen corresponding path program 1 times [2018-11-06 19:54:55,851 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:55,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:55,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:54:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:56,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:54:56,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:54:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:54:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:54:56,147 INFO L87 Difference]: Start difference. First operand 6649 states and 8832 transitions. Second operand 4 states. [2018-11-06 19:54:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:54:58,797 INFO L93 Difference]: Finished difference Result 13297 states and 17664 transitions. [2018-11-06 19:54:58,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:54:58,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-11-06 19:54:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:54:58,819 INFO L225 Difference]: With dead ends: 13297 [2018-11-06 19:54:58,819 INFO L226 Difference]: Without dead ends: 6650 [2018-11-06 19:54:58,830 INFO L604 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-11-06 19:54:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6650 states. [2018-11-06 19:54:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6650 to 6649. [2018-11-06 19:54:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6649 states. [2018-11-06 19:54:58,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6649 states to 6649 states and 8345 transitions. [2018-11-06 19:54:58,955 INFO L78 Accepts]: Start accepts. Automaton has 6649 states and 8345 transitions. Word has length 197 [2018-11-06 19:54:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:54:58,956 INFO L480 AbstractCegarLoop]: Abstraction has 6649 states and 8345 transitions. [2018-11-06 19:54:58,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:54:58,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6649 states and 8345 transitions. [2018-11-06 19:54:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-06 19:54:58,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:54:58,971 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-11-06 19:54:58,972 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:54:58,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:54:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash 253101429, now seen corresponding path program 1 times [2018-11-06 19:54:58,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:54:58,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:54:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:58,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:54:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:54:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:54:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-06 19:54:59,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:54:59,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:54:59,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:54:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:54:59,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:54:59,169 INFO L87 Difference]: Start difference. First operand 6649 states and 8345 transitions. Second operand 3 states. [2018-11-06 19:55:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:00,013 INFO L93 Difference]: Finished difference Result 13264 states and 16645 transitions. [2018-11-06 19:55:00,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:00,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2018-11-06 19:55:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:00,041 INFO L225 Difference]: With dead ends: 13264 [2018-11-06 19:55:00,042 INFO L226 Difference]: Without dead ends: 6617 [2018-11-06 19:55:00,050 INFO L604 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-11-06 19:55:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-11-06 19:55:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6617. [2018-11-06 19:55:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6617 states. [2018-11-06 19:55:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6617 states to 6617 states and 8118 transitions. [2018-11-06 19:55:00,156 INFO L78 Accepts]: Start accepts. Automaton has 6617 states and 8118 transitions. Word has length 218 [2018-11-06 19:55:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:00,157 INFO L480 AbstractCegarLoop]: Abstraction has 6617 states and 8118 transitions. [2018-11-06 19:55:00,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:00,157 INFO L276 IsEmpty]: Start isEmpty. Operand 6617 states and 8118 transitions. [2018-11-06 19:55:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-06 19:55:00,170 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:00,170 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-11-06 19:55:00,170 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:00,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1785953004, now seen corresponding path program 1 times [2018-11-06 19:55:00,171 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:00,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:55:00,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:00,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:00,351 INFO L87 Difference]: Start difference. First operand 6617 states and 8118 transitions. Second operand 3 states. [2018-11-06 19:55:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:01,856 INFO L93 Difference]: Finished difference Result 15882 states and 19789 transitions. [2018-11-06 19:55:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:01,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2018-11-06 19:55:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:01,873 INFO L225 Difference]: With dead ends: 15882 [2018-11-06 19:55:01,873 INFO L226 Difference]: Without dead ends: 9267 [2018-11-06 19:55:01,880 INFO L604 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-11-06 19:55:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9267 states. [2018-11-06 19:55:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9267 to 9267. [2018-11-06 19:55:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9267 states. [2018-11-06 19:55:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9267 states to 9267 states and 10892 transitions. [2018-11-06 19:55:02,011 INFO L78 Accepts]: Start accepts. Automaton has 9267 states and 10892 transitions. Word has length 222 [2018-11-06 19:55:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:02,011 INFO L480 AbstractCegarLoop]: Abstraction has 9267 states and 10892 transitions. [2018-11-06 19:55:02,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9267 states and 10892 transitions. [2018-11-06 19:55:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-06 19:55:02,032 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:02,032 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-11-06 19:55:02,032 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:02,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash 324309577, now seen corresponding path program 1 times [2018-11-06 19:55:02,033 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:02,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-06 19:55:02,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:02,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:02,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:02,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:02,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:02,182 INFO L87 Difference]: Start difference. First operand 9267 states and 10892 transitions. Second operand 3 states. [2018-11-06 19:55:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:03,499 INFO L93 Difference]: Finished difference Result 26494 states and 31046 transitions. [2018-11-06 19:55:03,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:03,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2018-11-06 19:55:03,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:03,534 INFO L225 Difference]: With dead ends: 26494 [2018-11-06 19:55:03,534 INFO L226 Difference]: Without dead ends: 17229 [2018-11-06 19:55:03,547 INFO L604 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-11-06 19:55:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2018-11-06 19:55:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 17225. [2018-11-06 19:55:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-11-06 19:55:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19750 transitions. [2018-11-06 19:55:03,776 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19750 transitions. Word has length 249 [2018-11-06 19:55:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:03,777 INFO L480 AbstractCegarLoop]: Abstraction has 17225 states and 19750 transitions. [2018-11-06 19:55:03,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19750 transitions. [2018-11-06 19:55:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-11-06 19:55:03,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:03,802 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-11-06 19:55:03,802 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:03,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 585273194, now seen corresponding path program 1 times [2018-11-06 19:55:03,802 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:03,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-06 19:55:04,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:04,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:04,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:04,147 INFO L87 Difference]: Start difference. First operand 17225 states and 19750 transitions. Second operand 4 states. [2018-11-06 19:55:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:05,941 INFO L93 Difference]: Finished difference Result 34456 states and 39512 transitions. [2018-11-06 19:55:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:05,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2018-11-06 19:55:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:05,971 INFO L225 Difference]: With dead ends: 34456 [2018-11-06 19:55:05,972 INFO L226 Difference]: Without dead ends: 17233 [2018-11-06 19:55:05,991 INFO L604 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-11-06 19:55:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17233 states. [2018-11-06 19:55:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17233 to 17225. [2018-11-06 19:55:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17225 states. [2018-11-06 19:55:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17225 states to 17225 states and 19548 transitions. [2018-11-06 19:55:06,383 INFO L78 Accepts]: Start accepts. Automaton has 17225 states and 19548 transitions. Word has length 256 [2018-11-06 19:55:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:06,384 INFO L480 AbstractCegarLoop]: Abstraction has 17225 states and 19548 transitions. [2018-11-06 19:55:06,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 17225 states and 19548 transitions. [2018-11-06 19:55:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-11-06 19:55:06,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:06,407 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-11-06 19:55:06,407 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:06,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:06,408 INFO L82 PathProgramCache]: Analyzing trace with hash -491815230, now seen corresponding path program 1 times [2018-11-06 19:55:06,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-06 19:55:06,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:06,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:55:06,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:55:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:55:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:55:06,721 INFO L87 Difference]: Start difference. First operand 17225 states and 19548 transitions. Second operand 5 states. [2018-11-06 19:55:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:08,844 INFO L93 Difference]: Finished difference Result 52673 states and 59425 transitions. [2018-11-06 19:55:08,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:55:08,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2018-11-06 19:55:08,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:08,904 INFO L225 Difference]: With dead ends: 52673 [2018-11-06 19:55:08,905 INFO L226 Difference]: Without dead ends: 35450 [2018-11-06 19:55:08,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:55:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35450 states. [2018-11-06 19:55:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35450 to 35445. [2018-11-06 19:55:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35445 states. [2018-11-06 19:55:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35445 states to 35445 states and 39830 transitions. [2018-11-06 19:55:09,416 INFO L78 Accepts]: Start accepts. Automaton has 35445 states and 39830 transitions. Word has length 269 [2018-11-06 19:55:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:09,417 INFO L480 AbstractCegarLoop]: Abstraction has 35445 states and 39830 transitions. [2018-11-06 19:55:09,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:55:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35445 states and 39830 transitions. [2018-11-06 19:55:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-11-06 19:55:09,444 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:09,445 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-11-06 19:55:09,445 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:09,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -517916135, now seen corresponding path program 1 times [2018-11-06 19:55:09,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:09,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:55:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:09,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:09,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:09,813 INFO L87 Difference]: Start difference. First operand 35445 states and 39830 transitions. Second operand 4 states. [2018-11-06 19:55:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:12,250 INFO L93 Difference]: Finished difference Result 73150 states and 82339 transitions. [2018-11-06 19:55:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:12,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-11-06 19:55:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:12,296 INFO L225 Difference]: With dead ends: 73150 [2018-11-06 19:55:12,296 INFO L226 Difference]: Without dead ends: 37707 [2018-11-06 19:55:12,323 INFO L604 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-11-06 19:55:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37707 states. [2018-11-06 19:55:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37707 to 37695. [2018-11-06 19:55:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-11-06 19:55:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 42345 transitions. [2018-11-06 19:55:12,774 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 42345 transitions. Word has length 277 [2018-11-06 19:55:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:12,774 INFO L480 AbstractCegarLoop]: Abstraction has 37695 states and 42345 transitions. [2018-11-06 19:55:12,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 42345 transitions. [2018-11-06 19:55:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-11-06 19:55:12,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:12,793 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-11-06 19:55:12,793 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:12,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1028863245, now seen corresponding path program 1 times [2018-11-06 19:55:12,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:12,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:12,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:55:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:13,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:13,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:13,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:13,089 INFO L87 Difference]: Start difference. First operand 37695 states and 42345 transitions. Second operand 4 states. [2018-11-06 19:55:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:14,763 INFO L93 Difference]: Finished difference Result 75399 states and 84709 transitions. [2018-11-06 19:55:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:14,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-11-06 19:55:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:14,808 INFO L225 Difference]: With dead ends: 75399 [2018-11-06 19:55:14,809 INFO L226 Difference]: Without dead ends: 37706 [2018-11-06 19:55:14,839 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37706 states. [2018-11-06 19:55:15,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37706 to 37695. [2018-11-06 19:55:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37695 states. [2018-11-06 19:55:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37695 states to 37695 states and 41937 transitions. [2018-11-06 19:55:15,188 INFO L78 Accepts]: Start accepts. Automaton has 37695 states and 41937 transitions. Word has length 278 [2018-11-06 19:55:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:15,188 INFO L480 AbstractCegarLoop]: Abstraction has 37695 states and 41937 transitions. [2018-11-06 19:55:15,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37695 states and 41937 transitions. [2018-11-06 19:55:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-11-06 19:55:15,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:15,204 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-11-06 19:55:15,204 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:15,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -929080328, now seen corresponding path program 1 times [2018-11-06 19:55:15,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:15,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:15,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:15,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:55:15,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:15,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:15,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:15,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:15,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:15,806 INFO L87 Difference]: Start difference. First operand 37695 states and 41937 transitions. Second operand 3 states. [2018-11-06 19:55:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:18,061 INFO L93 Difference]: Finished difference Result 73343 states and 81685 transitions. [2018-11-06 19:55:18,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:18,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2018-11-06 19:55:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:18,103 INFO L225 Difference]: With dead ends: 73343 [2018-11-06 19:55:18,103 INFO L226 Difference]: Without dead ends: 35650 [2018-11-06 19:55:18,130 INFO L604 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-11-06 19:55:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35650 states. [2018-11-06 19:55:18,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35650 to 35647. [2018-11-06 19:55:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35647 states. [2018-11-06 19:55:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35647 states to 35647 states and 38821 transitions. [2018-11-06 19:55:18,524 INFO L78 Accepts]: Start accepts. Automaton has 35647 states and 38821 transitions. Word has length 294 [2018-11-06 19:55:18,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:18,525 INFO L480 AbstractCegarLoop]: Abstraction has 35647 states and 38821 transitions. [2018-11-06 19:55:18,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35647 states and 38821 transitions. [2018-11-06 19:55:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-11-06 19:55:18,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:18,540 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-11-06 19:55:18,540 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:18,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash 896536754, now seen corresponding path program 1 times [2018-11-06 19:55:18,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:18,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:19,090 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:55:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:19,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:19,092 INFO L87 Difference]: Start difference. First operand 35647 states and 38821 transitions. Second operand 4 states. [2018-11-06 19:55:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:21,114 INFO L93 Difference]: Finished difference Result 135836 states and 147858 transitions. [2018-11-06 19:55:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:21,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2018-11-06 19:55:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:21,215 INFO L225 Difference]: With dead ends: 135836 [2018-11-06 19:55:21,215 INFO L226 Difference]: Without dead ends: 100191 [2018-11-06 19:55:21,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100191 states. [2018-11-06 19:55:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100191 to 64134. [2018-11-06 19:55:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64134 states. [2018-11-06 19:55:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64134 states to 64134 states and 69822 transitions. [2018-11-06 19:55:22,189 INFO L78 Accepts]: Start accepts. Automaton has 64134 states and 69822 transitions. Word has length 298 [2018-11-06 19:55:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:22,190 INFO L480 AbstractCegarLoop]: Abstraction has 64134 states and 69822 transitions. [2018-11-06 19:55:22,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 64134 states and 69822 transitions. [2018-11-06 19:55:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-11-06 19:55:22,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:22,622 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-11-06 19:55:22,623 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:22,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:22,623 INFO L82 PathProgramCache]: Analyzing trace with hash 126833866, now seen corresponding path program 1 times [2018-11-06 19:55:22,623 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:22,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:22,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:55:22,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:22,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:55:22,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:55:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:55:22,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:55:22,863 INFO L87 Difference]: Start difference. First operand 64134 states and 69822 transitions. Second operand 3 states. [2018-11-06 19:55:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:24,815 INFO L93 Difference]: Finished difference Result 158805 states and 172541 transitions. [2018-11-06 19:55:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:55:24,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2018-11-06 19:55:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:24,932 INFO L225 Difference]: With dead ends: 158805 [2018-11-06 19:55:24,932 INFO L226 Difference]: Without dead ends: 94673 [2018-11-06 19:55:24,982 INFO L604 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-11-06 19:55:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94673 states. [2018-11-06 19:55:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94673 to 92616. [2018-11-06 19:55:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92616 states. [2018-11-06 19:55:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92616 states to 92616 states and 100489 transitions. [2018-11-06 19:55:25,906 INFO L78 Accepts]: Start accepts. Automaton has 92616 states and 100489 transitions. Word has length 318 [2018-11-06 19:55:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:25,907 INFO L480 AbstractCegarLoop]: Abstraction has 92616 states and 100489 transitions. [2018-11-06 19:55:25,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:55:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 92616 states and 100489 transitions. [2018-11-06 19:55:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-11-06 19:55:25,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:25,928 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-11-06 19:55:25,928 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:25,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1579485379, now seen corresponding path program 1 times [2018-11-06 19:55:25,929 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:25,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-06 19:55:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:55:26,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:55:26,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:26,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:26,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:26,467 INFO L87 Difference]: Start difference. First operand 92616 states and 100489 transitions. Second operand 4 states. [2018-11-06 19:55:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:29,821 INFO L93 Difference]: Finished difference Result 268198 states and 290902 transitions. [2018-11-06 19:55:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:55:29,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-11-06 19:55:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:30,013 INFO L225 Difference]: With dead ends: 268198 [2018-11-06 19:55:30,013 INFO L226 Difference]: Without dead ends: 170869 [2018-11-06 19:55:30,087 INFO L604 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-11-06 19:55:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170869 states. [2018-11-06 19:55:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170869 to 169432. [2018-11-06 19:55:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169432 states. [2018-11-06 19:55:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169432 states to 169432 states and 181761 transitions. [2018-11-06 19:55:31,892 INFO L78 Accepts]: Start accepts. Automaton has 169432 states and 181761 transitions. Word has length 320 [2018-11-06 19:55:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:31,892 INFO L480 AbstractCegarLoop]: Abstraction has 169432 states and 181761 transitions. [2018-11-06 19:55:31,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:55:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 169432 states and 181761 transitions. [2018-11-06 19:55:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-11-06 19:55:31,919 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:31,920 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-11-06 19:55:31,920 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:31,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1328338570, now seen corresponding path program 1 times [2018-11-06 19:55:31,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:31,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:31,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:31,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:31,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:32,291 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:55:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 133 proven. 4 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-11-06 19:55:32,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:55:32,571 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:55:32,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:32,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:32,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:55:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-06 19:55:33,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:55:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:55:33,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:55:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:55:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:55:33,842 INFO L87 Difference]: Start difference. First operand 169432 states and 181761 transitions. Second operand 6 states. [2018-11-06 19:55:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:55:42,209 INFO L93 Difference]: Finished difference Result 805370 states and 864039 transitions. [2018-11-06 19:55:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-06 19:55:42,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2018-11-06 19:55:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:55:43,015 INFO L225 Difference]: With dead ends: 805370 [2018-11-06 19:55:43,015 INFO L226 Difference]: Without dead ends: 635940 [2018-11-06 19:55:44,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:55:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635940 states. [2018-11-06 19:55:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635940 to 602296. [2018-11-06 19:55:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602296 states. [2018-11-06 19:55:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602296 states to 602296 states and 638430 transitions. [2018-11-06 19:55:53,099 INFO L78 Accepts]: Start accepts. Automaton has 602296 states and 638430 transitions. Word has length 326 [2018-11-06 19:55:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:55:53,100 INFO L480 AbstractCegarLoop]: Abstraction has 602296 states and 638430 transitions. [2018-11-06 19:55:53,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:55:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 602296 states and 638430 transitions. [2018-11-06 19:55:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-11-06 19:55:53,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:55:53,134 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-11-06 19:55:53,134 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:55:53,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:55:53,135 INFO L82 PathProgramCache]: Analyzing trace with hash -777036058, now seen corresponding path program 1 times [2018-11-06 19:55:53,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:55:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:55:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:53,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:53,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:55:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 32 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-06 19:55:53,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:55:53,713 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:55:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:55:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:55:53,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:55:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-11-06 19:55:54,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:55:54,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 19:55:54,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:55:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:55:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:55:54,113 INFO L87 Difference]: Start difference. First operand 602296 states and 638430 transitions. Second operand 4 states. [2018-11-06 19:56:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:12,079 INFO L93 Difference]: Finished difference Result 2002725 states and 2120342 transitions. [2018-11-06 19:56:12,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:12,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2018-11-06 19:56:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:16,146 INFO L225 Difference]: With dead ends: 2002725 [2018-11-06 19:56:16,146 INFO L226 Difference]: Without dead ends: 1400431 [2018-11-06 19:56:16,455 INFO L604 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-11-06 19:56:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400431 states. [2018-11-06 19:56:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400431 to 922658. [2018-11-06 19:56:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922658 states. [2018-11-06 19:56:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922658 states to 922658 states and 976476 transitions. [2018-11-06 19:56:49,333 INFO L78 Accepts]: Start accepts. Automaton has 922658 states and 976476 transitions. Word has length 378 [2018-11-06 19:56:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:49,334 INFO L480 AbstractCegarLoop]: Abstraction has 922658 states and 976476 transitions. [2018-11-06 19:56:49,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 922658 states and 976476 transitions. [2018-11-06 19:56:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-11-06 19:56:49,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:49,438 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-11-06 19:56:49,438 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:49,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1084773979, now seen corresponding path program 1 times [2018-11-06 19:56:49,439 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:49,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:49,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:49,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:49,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:49,964 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-06 19:56:50,161 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:56:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-06 19:56:50,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:50,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 19:56:50,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:50,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:50,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:50,327 INFO L87 Difference]: Start difference. First operand 922658 states and 976476 transitions. Second operand 5 states. [2018-11-06 19:57:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:04,207 INFO L93 Difference]: Finished difference Result 2030370 states and 2148031 transitions. [2018-11-06 19:57:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:57:04,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2018-11-06 19:57:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:07,512 INFO L225 Difference]: With dead ends: 2030370 [2018-11-06 19:57:07,513 INFO L226 Difference]: Without dead ends: 1107714 [2018-11-06 19:57:07,769 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:57:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107714 states. [2018-11-06 19:57:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107714 to 965836. [2018-11-06 19:57:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965836 states. [2018-11-06 19:57:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965836 states to 965836 states and 1025224 transitions. [2018-11-06 19:57:40,363 INFO L78 Accepts]: Start accepts. Automaton has 965836 states and 1025224 transitions. Word has length 388 [2018-11-06 19:57:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:40,364 INFO L480 AbstractCegarLoop]: Abstraction has 965836 states and 1025224 transitions. [2018-11-06 19:57:40,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:57:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 965836 states and 1025224 transitions. [2018-11-06 19:57:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-11-06 19:57:40,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:40,431 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-11-06 19:57:40,431 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:40,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash -380448547, now seen corresponding path program 1 times [2018-11-06 19:57:40,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:40,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:40,933 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:57:41,145 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-06 19:57:41,308 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2018-11-06 19:57:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 347 proven. 55 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-06 19:57:41,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:57:41,920 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:57:41,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:42,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:57:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-11-06 19:57:43,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:57:43,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-06 19:57:43,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-06 19:57:43,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-06 19:57:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-06 19:57:43,156 INFO L87 Difference]: Start difference. First operand 965836 states and 1025224 transitions. Second operand 10 states. Received shutdown request... [2018-11-06 19:57:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:57:43,845 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:57:43,852 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:57:43,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:57:43 BoogieIcfgContainer [2018-11-06 19:57:43,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:57:43,854 INFO L168 Benchmark]: Toolchain (without parser) took 189988.28 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.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2018-11-06 19:57:43,856 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:57:43,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1233.69 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-11-06 19:57:43,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 318.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2018-11-06 19:57:43,859 INFO L168 Benchmark]: Boogie Preprocessor took 148.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:57:43,859 INFO L168 Benchmark]: RCFGBuilder took 5368.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:57:43,860 INFO L168 Benchmark]: TraceAbstraction took 182912.59 ms. Allocated memory was 2.3 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.8 GB in the end (delta: -902.0 MB). Peak memory consumption was 4.0 GB. Max. memory is 7.1 GB. [2018-11-06 19:57:43,869 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1233.69 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 318.26 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -852.2 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.77 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5368.68 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 257.8 MB). Peak memory consumption was 257.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 182912.59 ms. Allocated memory was 2.3 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.8 GB in the end (delta: -902.0 MB). Peak memory consumption was 4.0 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 4 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (25 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 182.8s OverallTime, 21 OverallIterations, 7 TraceHistogramMax, 88.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5830 SDtfs, 10964 SDslu, 4098 SDs, 0 SdLazy, 18254 SolverSat, 3604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 1155 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.9s 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: 80.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 693171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.3s 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