java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:53:58,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:53:58,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:53:58,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:53:58,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:53:58,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:53:58,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:53:58,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:53:58,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:53:58,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:53:58,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:53:58,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:53:58,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:53:58,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:53:58,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:53:58,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:53:58,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:53:58,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:53:58,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:53:58,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:53:58,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:53:58,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:53:58,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:53:58,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:53:58,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:53:58,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:53:58,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:53:58,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:53:58,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:53:58,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:53:58,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:53:58,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:53:58,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:53:58,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:53:58,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:53:58,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:53:58,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:53:58,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:53:58,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:53:58,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:53:58,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:53:58,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:53:58,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:53:58,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:53:58,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:53:58,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:53:58,946 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:53:58,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:53:58,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:53:58,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:53:58,948 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:53:58,948 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:53:58,948 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:53:58,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:53:58,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:53:58,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:53:58,949 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:53:58,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:53:58,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:53:58,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:53:58,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:53:58,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:53:58,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:53:58,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:53:58,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:53:58,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:53:58,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:53:58,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:53:59,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:53:59,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:53:59,005 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:53:59,005 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:53:59,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e015fd1c9/fb4b024c583d4ffabb71d6b1afcf89f1/FLAG71cec455b [2019-09-08 12:53:59,542 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:53:59,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:53:59,557 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e015fd1c9/fb4b024c583d4ffabb71d6b1afcf89f1/FLAG71cec455b [2019-09-08 12:53:59,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e015fd1c9/fb4b024c583d4ffabb71d6b1afcf89f1 [2019-09-08 12:53:59,909 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:53:59,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:53:59,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:53:59,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:53:59,916 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:53:59,917 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:53:59" (1/1) ... [2019-09-08 12:53:59,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b60ac12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:53:59, skipping insertion in model container [2019-09-08 12:53:59,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:53:59" (1/1) ... [2019-09-08 12:53:59,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:53:59,992 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:54:00,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:00,475 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:54:00,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:54:00,634 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:54:00,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00 WrapperNode [2019-09-08 12:54:00,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:54:00,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:54:00,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:54:00,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:54:00,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... [2019-09-08 12:54:00,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:54:00,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:54:00,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:54:00,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:54:00,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:54:00,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:54:00,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:54:00,828 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:54:00,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:54:00,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:54:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:54:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:54:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:54:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:54:00,829 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:54:00,830 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:54:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:54:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:54:00,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:54:01,649 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:54:01,649 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:54:01,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:01 BoogieIcfgContainer [2019-09-08 12:54:01,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:54:01,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:54:01,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:54:01,655 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:54:01,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:53:59" (1/3) ... [2019-09-08 12:54:01,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c27205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:01, skipping insertion in model container [2019-09-08 12:54:01,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:54:00" (2/3) ... [2019-09-08 12:54:01,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c27205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:54:01, skipping insertion in model container [2019-09-08 12:54:01,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:54:01" (3/3) ... [2019-09-08 12:54:01,659 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:54:01,669 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:54:01,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:54:01,694 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:54:01,725 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:54:01,726 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:54:01,726 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:54:01,726 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:54:01,727 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:54:01,727 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:54:01,727 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:54:01,727 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:54:01,727 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:54:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-09-08 12:54:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 12:54:01,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:01,759 INFO L399 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] [2019-09-08 12:54:01,761 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:01,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1085569870, now seen corresponding path program 1 times [2019-09-08 12:54:01,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:01,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:01,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:02,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:02,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:02,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:02,294 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-09-08 12:54:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:02,440 INFO L93 Difference]: Finished difference Result 342 states and 566 transitions. [2019-09-08 12:54:02,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:02,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 12:54:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:02,459 INFO L225 Difference]: With dead ends: 342 [2019-09-08 12:54:02,460 INFO L226 Difference]: Without dead ends: 235 [2019-09-08 12:54:02,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-08 12:54:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-09-08 12:54:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-08 12:54:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 363 transitions. [2019-09-08 12:54:02,534 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 363 transitions. Word has length 60 [2019-09-08 12:54:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:02,535 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 363 transitions. [2019-09-08 12:54:02,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 363 transitions. [2019-09-08 12:54:02,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 12:54:02,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:02,539 INFO L399 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] [2019-09-08 12:54:02,540 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1093309265, now seen corresponding path program 1 times [2019-09-08 12:54:02,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:02,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:02,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:02,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:02,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:02,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:02,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:02,680 INFO L87 Difference]: Start difference. First operand 232 states and 363 transitions. Second operand 3 states. [2019-09-08 12:54:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:02,782 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-09-08 12:54:02,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:02,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-09-08 12:54:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:02,791 INFO L225 Difference]: With dead ends: 570 [2019-09-08 12:54:02,794 INFO L226 Difference]: Without dead ends: 393 [2019-09-08 12:54:02,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-08 12:54:02,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2019-09-08 12:54:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-09-08 12:54:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 618 transitions. [2019-09-08 12:54:02,869 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 618 transitions. Word has length 62 [2019-09-08 12:54:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:02,870 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 618 transitions. [2019-09-08 12:54:02,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 618 transitions. [2019-09-08 12:54:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 12:54:02,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:02,876 INFO L399 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] [2019-09-08 12:54:02,878 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash 647852560, now seen corresponding path program 1 times [2019-09-08 12:54:02,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:02,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:02,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:02,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:03,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:03,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:03,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:03,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:03,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:03,048 INFO L87 Difference]: Start difference. First operand 389 states and 618 transitions. Second operand 3 states. [2019-09-08 12:54:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:03,100 INFO L93 Difference]: Finished difference Result 1025 states and 1652 transitions. [2019-09-08 12:54:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:03,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 12:54:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:03,106 INFO L225 Difference]: With dead ends: 1025 [2019-09-08 12:54:03,106 INFO L226 Difference]: Without dead ends: 691 [2019-09-08 12:54:03,108 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-08 12:54:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2019-09-08 12:54:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-09-08 12:54:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2019-09-08 12:54:03,141 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1094 transitions. Word has length 64 [2019-09-08 12:54:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:03,141 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1094 transitions. [2019-09-08 12:54:03,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1094 transitions. [2019-09-08 12:54:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 12:54:03,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:03,144 INFO L399 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] [2019-09-08 12:54:03,145 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash -971934415, now seen corresponding path program 1 times [2019-09-08 12:54:03,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:03,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:03,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:03,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:03,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:03,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:03,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:03,297 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. Second operand 5 states. [2019-09-08 12:54:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:03,518 INFO L93 Difference]: Finished difference Result 2313 states and 3756 transitions. [2019-09-08 12:54:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:03,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-09-08 12:54:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:03,533 INFO L225 Difference]: With dead ends: 2313 [2019-09-08 12:54:03,533 INFO L226 Difference]: Without dead ends: 1683 [2019-09-08 12:54:03,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-09-08 12:54:03,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1500. [2019-09-08 12:54:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-09-08 12:54:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2423 transitions. [2019-09-08 12:54:03,618 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2423 transitions. Word has length 66 [2019-09-08 12:54:03,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:03,619 INFO L475 AbstractCegarLoop]: Abstraction has 1500 states and 2423 transitions. [2019-09-08 12:54:03,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2423 transitions. [2019-09-08 12:54:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 12:54:03,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:03,622 INFO L399 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] [2019-09-08 12:54:03,623 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:03,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:03,623 INFO L82 PathProgramCache]: Analyzing trace with hash -126806256, now seen corresponding path program 1 times [2019-09-08 12:54:03,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:03,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:03,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:03,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:03,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:54:03,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:54:03,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:54:03,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:54:03,776 INFO L87 Difference]: Start difference. First operand 1500 states and 2423 transitions. Second operand 6 states. [2019-09-08 12:54:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:04,232 INFO L93 Difference]: Finished difference Result 5957 states and 9657 transitions. [2019-09-08 12:54:04,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:54:04,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-08 12:54:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:04,255 INFO L225 Difference]: With dead ends: 5957 [2019-09-08 12:54:04,255 INFO L226 Difference]: Without dead ends: 4512 [2019-09-08 12:54:04,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-09-08 12:54:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4409. [2019-09-08 12:54:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-09-08 12:54:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7126 transitions. [2019-09-08 12:54:04,485 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7126 transitions. Word has length 67 [2019-09-08 12:54:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:04,485 INFO L475 AbstractCegarLoop]: Abstraction has 4409 states and 7126 transitions. [2019-09-08 12:54:04,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:54:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7126 transitions. [2019-09-08 12:54:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 12:54:04,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:04,487 INFO L399 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] [2019-09-08 12:54:04,488 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 306920920, now seen corresponding path program 1 times [2019-09-08 12:54:04,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:04,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:04,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:04,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:04,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:04,610 INFO L87 Difference]: Start difference. First operand 4409 states and 7126 transitions. Second operand 4 states. [2019-09-08 12:54:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:04,999 INFO L93 Difference]: Finished difference Result 10298 states and 16697 transitions. [2019-09-08 12:54:04,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:05,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-08 12:54:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:05,033 INFO L225 Difference]: With dead ends: 10298 [2019-09-08 12:54:05,033 INFO L226 Difference]: Without dead ends: 6343 [2019-09-08 12:54:05,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-09-08 12:54:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6316. [2019-09-08 12:54:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-09-08 12:54:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 10205 transitions. [2019-09-08 12:54:05,398 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 10205 transitions. Word has length 68 [2019-09-08 12:54:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:05,399 INFO L475 AbstractCegarLoop]: Abstraction has 6316 states and 10205 transitions. [2019-09-08 12:54:05,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 10205 transitions. [2019-09-08 12:54:05,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 12:54:05,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:05,401 INFO L399 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] [2019-09-08 12:54:05,402 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:05,402 INFO L82 PathProgramCache]: Analyzing trace with hash 872119511, now seen corresponding path program 1 times [2019-09-08 12:54:05,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:05,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:05,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:05,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:05,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:05,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:05,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:05,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:05,599 INFO L87 Difference]: Start difference. First operand 6316 states and 10205 transitions. Second operand 4 states. [2019-09-08 12:54:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:06,340 INFO L93 Difference]: Finished difference Result 18451 states and 29920 transitions. [2019-09-08 12:54:06,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:06,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 12:54:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:06,423 INFO L225 Difference]: With dead ends: 18451 [2019-09-08 12:54:06,423 INFO L226 Difference]: Without dead ends: 12686 [2019-09-08 12:54:06,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2019-09-08 12:54:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8636. [2019-09-08 12:54:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-09-08 12:54:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 13951 transitions. [2019-09-08 12:54:06,940 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 13951 transitions. Word has length 69 [2019-09-08 12:54:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:06,942 INFO L475 AbstractCegarLoop]: Abstraction has 8636 states and 13951 transitions. [2019-09-08 12:54:06,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 13951 transitions. [2019-09-08 12:54:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:54:06,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:06,951 INFO L399 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] [2019-09-08 12:54:06,951 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:06,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1806428220, now seen corresponding path program 1 times [2019-09-08 12:54:06,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:06,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:06,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:06,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:07,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:07,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:07,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:07,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:07,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:07,039 INFO L87 Difference]: Start difference. First operand 8636 states and 13951 transitions. Second operand 3 states. [2019-09-08 12:54:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:07,612 INFO L93 Difference]: Finished difference Result 19227 states and 31095 transitions. [2019-09-08 12:54:07,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:07,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:54:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:07,646 INFO L225 Difference]: With dead ends: 19227 [2019-09-08 12:54:07,646 INFO L226 Difference]: Without dead ends: 12825 [2019-09-08 12:54:07,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:07,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-09-08 12:54:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 12823. [2019-09-08 12:54:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12823 states. [2019-09-08 12:54:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12823 states to 12823 states and 20604 transitions. [2019-09-08 12:54:08,329 INFO L78 Accepts]: Start accepts. Automaton has 12823 states and 20604 transitions. Word has length 70 [2019-09-08 12:54:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:08,329 INFO L475 AbstractCegarLoop]: Abstraction has 12823 states and 20604 transitions. [2019-09-08 12:54:08,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 12823 states and 20604 transitions. [2019-09-08 12:54:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:54:08,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:08,332 INFO L399 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] [2019-09-08 12:54:08,332 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -552777714, now seen corresponding path program 1 times [2019-09-08 12:54:08,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:08,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:08,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:08,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:08,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:08,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:08,410 INFO L87 Difference]: Start difference. First operand 12823 states and 20604 transitions. Second operand 3 states. [2019-09-08 12:54:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:09,245 INFO L93 Difference]: Finished difference Result 27737 states and 44670 transitions. [2019-09-08 12:54:09,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:09,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:54:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:09,291 INFO L225 Difference]: With dead ends: 27737 [2019-09-08 12:54:09,291 INFO L226 Difference]: Without dead ends: 18500 [2019-09-08 12:54:09,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:09,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2019-09-08 12:54:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 18498. [2019-09-08 12:54:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18498 states. [2019-09-08 12:54:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 29596 transitions. [2019-09-08 12:54:10,660 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 29596 transitions. Word has length 70 [2019-09-08 12:54:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:10,660 INFO L475 AbstractCegarLoop]: Abstraction has 18498 states and 29596 transitions. [2019-09-08 12:54:10,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 29596 transitions. [2019-09-08 12:54:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 12:54:10,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:10,662 INFO L399 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] [2019-09-08 12:54:10,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1170468960, now seen corresponding path program 1 times [2019-09-08 12:54:10,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:10,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:10,714 INFO L87 Difference]: Start difference. First operand 18498 states and 29596 transitions. Second operand 3 states. [2019-09-08 12:54:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:11,601 INFO L93 Difference]: Finished difference Result 42427 states and 68162 transitions. [2019-09-08 12:54:11,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:11,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 12:54:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:11,668 INFO L225 Difference]: With dead ends: 42427 [2019-09-08 12:54:11,669 INFO L226 Difference]: Without dead ends: 27744 [2019-09-08 12:54:11,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27744 states. [2019-09-08 12:54:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27744 to 27742. [2019-09-08 12:54:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-09-08 12:54:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44151 transitions. [2019-09-08 12:54:12,984 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44151 transitions. Word has length 70 [2019-09-08 12:54:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:12,984 INFO L475 AbstractCegarLoop]: Abstraction has 27742 states and 44151 transitions. [2019-09-08 12:54:12,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44151 transitions. [2019-09-08 12:54:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 12:54:12,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:12,986 INFO L399 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] [2019-09-08 12:54:12,986 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -901408249, now seen corresponding path program 1 times [2019-09-08 12:54:12,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:12,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:12,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:13,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:13,145 INFO L87 Difference]: Start difference. First operand 27742 states and 44151 transitions. Second operand 5 states. [2019-09-08 12:54:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:14,640 INFO L93 Difference]: Finished difference Result 57487 states and 91562 transitions. [2019-09-08 12:54:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:14,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 12:54:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:14,712 INFO L225 Difference]: With dead ends: 57487 [2019-09-08 12:54:14,712 INFO L226 Difference]: Without dead ends: 29834 [2019-09-08 12:54:14,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29834 states. [2019-09-08 12:54:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29834 to 27742. [2019-09-08 12:54:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-09-08 12:54:15,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44016 transitions. [2019-09-08 12:54:15,830 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44016 transitions. Word has length 71 [2019-09-08 12:54:15,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:15,831 INFO L475 AbstractCegarLoop]: Abstraction has 27742 states and 44016 transitions. [2019-09-08 12:54:15,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44016 transitions. [2019-09-08 12:54:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 12:54:15,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:15,832 INFO L399 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] [2019-09-08 12:54:15,832 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:15,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 527849417, now seen corresponding path program 1 times [2019-09-08 12:54:15,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:15,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:15,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:15,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:15,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:15,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:15,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:15,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:15,991 INFO L87 Difference]: Start difference. First operand 27742 states and 44016 transitions. Second operand 5 states. [2019-09-08 12:54:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:18,008 INFO L93 Difference]: Finished difference Result 89911 states and 143015 transitions. [2019-09-08 12:54:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:18,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 12:54:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:18,102 INFO L225 Difference]: With dead ends: 89911 [2019-09-08 12:54:18,102 INFO L226 Difference]: Without dead ends: 62258 [2019-09-08 12:54:18,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62258 states. [2019-09-08 12:54:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62258 to 38998. [2019-09-08 12:54:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38998 states. [2019-09-08 12:54:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38998 states to 38998 states and 61670 transitions. [2019-09-08 12:54:20,578 INFO L78 Accepts]: Start accepts. Automaton has 38998 states and 61670 transitions. Word has length 74 [2019-09-08 12:54:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:20,579 INFO L475 AbstractCegarLoop]: Abstraction has 38998 states and 61670 transitions. [2019-09-08 12:54:20,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38998 states and 61670 transitions. [2019-09-08 12:54:20,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 12:54:20,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:20,580 INFO L399 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] [2019-09-08 12:54:20,580 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:20,581 INFO L82 PathProgramCache]: Analyzing trace with hash -818446556, now seen corresponding path program 1 times [2019-09-08 12:54:20,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:20,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:20,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:20,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:20,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:20,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:20,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:20,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:20,688 INFO L87 Difference]: Start difference. First operand 38998 states and 61670 transitions. Second operand 5 states. [2019-09-08 12:54:23,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:23,059 INFO L93 Difference]: Finished difference Result 68965 states and 108517 transitions. [2019-09-08 12:54:23,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:54:23,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 12:54:23,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:23,157 INFO L225 Difference]: With dead ends: 68965 [2019-09-08 12:54:23,158 INFO L226 Difference]: Without dead ends: 68963 [2019-09-08 12:54:23,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:54:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68963 states. [2019-09-08 12:54:25,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68963 to 39854. [2019-09-08 12:54:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39854 states. [2019-09-08 12:54:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39854 states to 39854 states and 62517 transitions. [2019-09-08 12:54:26,044 INFO L78 Accepts]: Start accepts. Automaton has 39854 states and 62517 transitions. Word has length 75 [2019-09-08 12:54:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:26,044 INFO L475 AbstractCegarLoop]: Abstraction has 39854 states and 62517 transitions. [2019-09-08 12:54:26,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 39854 states and 62517 transitions. [2019-09-08 12:54:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:54:26,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:26,047 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:26,047 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash -886490076, now seen corresponding path program 1 times [2019-09-08 12:54:26,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:26,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:26,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:26,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:26,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:26,114 INFO L87 Difference]: Start difference. First operand 39854 states and 62517 transitions. Second operand 3 states. [2019-09-08 12:54:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:27,559 INFO L93 Difference]: Finished difference Result 73854 states and 116239 transitions. [2019-09-08 12:54:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:27,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 12:54:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:27,605 INFO L225 Difference]: With dead ends: 73854 [2019-09-08 12:54:27,605 INFO L226 Difference]: Without dead ends: 34089 [2019-09-08 12:54:27,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2019-09-08 12:54:28,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 34087. [2019-09-08 12:54:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34087 states. [2019-09-08 12:54:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 53532 transitions. [2019-09-08 12:54:28,827 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 53532 transitions. Word has length 101 [2019-09-08 12:54:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:28,827 INFO L475 AbstractCegarLoop]: Abstraction has 34087 states and 53532 transitions. [2019-09-08 12:54:28,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 53532 transitions. [2019-09-08 12:54:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:54:28,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:28,829 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:28,829 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1522449336, now seen corresponding path program 1 times [2019-09-08 12:54:28,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:28,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:28,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:28,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:28,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:28,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:28,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:28,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:28,912 INFO L87 Difference]: Start difference. First operand 34087 states and 53532 transitions. Second operand 3 states. [2019-09-08 12:54:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:29,796 INFO L93 Difference]: Finished difference Result 47480 states and 74651 transitions. [2019-09-08 12:54:29,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:29,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 12:54:29,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:29,811 INFO L225 Difference]: With dead ends: 47480 [2019-09-08 12:54:29,811 INFO L226 Difference]: Without dead ends: 13512 [2019-09-08 12:54:29,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:29,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13512 states. [2019-09-08 12:54:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13512 to 13510. [2019-09-08 12:54:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13510 states. [2019-09-08 12:54:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13510 states to 13510 states and 21152 transitions. [2019-09-08 12:54:30,315 INFO L78 Accepts]: Start accepts. Automaton has 13510 states and 21152 transitions. Word has length 101 [2019-09-08 12:54:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:30,315 INFO L475 AbstractCegarLoop]: Abstraction has 13510 states and 21152 transitions. [2019-09-08 12:54:30,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13510 states and 21152 transitions. [2019-09-08 12:54:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:54:30,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:30,317 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:30,317 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1365075631, now seen corresponding path program 1 times [2019-09-08 12:54:30,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:30,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:30,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:30,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:30,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:54:30,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:54:30,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:30,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:54:30,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:54:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 12:54:30,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:54:30,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:54:30,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:54:30,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:54:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:54:30,715 INFO L87 Difference]: Start difference. First operand 13510 states and 21152 transitions. Second operand 8 states. [2019-09-08 12:54:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:32,940 INFO L93 Difference]: Finished difference Result 31098 states and 48931 transitions. [2019-09-08 12:54:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:54:32,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-09-08 12:54:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:33,019 INFO L225 Difference]: With dead ends: 31098 [2019-09-08 12:54:33,019 INFO L226 Difference]: Without dead ends: 23283 [2019-09-08 12:54:33,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:54:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-09-08 12:54:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 20346. [2019-09-08 12:54:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-09-08 12:54:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 31832 transitions. [2019-09-08 12:54:34,726 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 31832 transitions. Word has length 104 [2019-09-08 12:54:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:34,726 INFO L475 AbstractCegarLoop]: Abstraction has 20346 states and 31832 transitions. [2019-09-08 12:54:34,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:54:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 31832 transitions. [2019-09-08 12:54:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:54:34,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:34,728 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:34,729 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:34,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1972121887, now seen corresponding path program 1 times [2019-09-08 12:54:34,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:34,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:34,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:54:34,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:34,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:54:34,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:54:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:54:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:34,865 INFO L87 Difference]: Start difference. First operand 20346 states and 31832 transitions. Second operand 5 states. [2019-09-08 12:54:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:35,998 INFO L93 Difference]: Finished difference Result 30080 states and 47102 transitions. [2019-09-08 12:54:35,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:54:35,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 12:54:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:36,060 INFO L225 Difference]: With dead ends: 30080 [2019-09-08 12:54:36,060 INFO L226 Difference]: Without dead ends: 22512 [2019-09-08 12:54:36,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22512 states. [2019-09-08 12:54:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22512 to 22506. [2019-09-08 12:54:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22506 states. [2019-09-08 12:54:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22506 states to 22506 states and 35198 transitions. [2019-09-08 12:54:37,439 INFO L78 Accepts]: Start accepts. Automaton has 22506 states and 35198 transitions. Word has length 104 [2019-09-08 12:54:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:37,439 INFO L475 AbstractCegarLoop]: Abstraction has 22506 states and 35198 transitions. [2019-09-08 12:54:37,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:54:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22506 states and 35198 transitions. [2019-09-08 12:54:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:54:37,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:37,441 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:37,441 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1335838415, now seen corresponding path program 1 times [2019-09-08 12:54:37,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:37,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:54:37,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:37,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:37,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:37,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:37,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:37,504 INFO L87 Difference]: Start difference. First operand 22506 states and 35198 transitions. Second operand 3 states. [2019-09-08 12:54:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:39,432 INFO L93 Difference]: Finished difference Result 55438 states and 86893 transitions. [2019-09-08 12:54:39,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:39,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 12:54:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:39,509 INFO L225 Difference]: With dead ends: 55438 [2019-09-08 12:54:39,509 INFO L226 Difference]: Without dead ends: 40460 [2019-09-08 12:54:39,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40460 states. [2019-09-08 12:54:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40460 to 40400. [2019-09-08 12:54:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40400 states. [2019-09-08 12:54:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 63171 transitions. [2019-09-08 12:54:41,677 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 63171 transitions. Word has length 105 [2019-09-08 12:54:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:41,677 INFO L475 AbstractCegarLoop]: Abstraction has 40400 states and 63171 transitions. [2019-09-08 12:54:41,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 63171 transitions. [2019-09-08 12:54:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:54:41,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:41,680 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:41,680 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:41,680 INFO L82 PathProgramCache]: Analyzing trace with hash -184437851, now seen corresponding path program 1 times [2019-09-08 12:54:41,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:41,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:41,746 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:41,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:41,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:41,748 INFO L87 Difference]: Start difference. First operand 40400 states and 63171 transitions. Second operand 3 states. [2019-09-08 12:54:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:42,489 INFO L93 Difference]: Finished difference Result 57851 states and 90536 transitions. [2019-09-08 12:54:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:42,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-08 12:54:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:42,514 INFO L225 Difference]: With dead ends: 57851 [2019-09-08 12:54:42,514 INFO L226 Difference]: Without dead ends: 17599 [2019-09-08 12:54:42,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17599 states. [2019-09-08 12:54:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17599 to 17597. [2019-09-08 12:54:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2019-09-08 12:54:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 27387 transitions. [2019-09-08 12:54:43,524 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 27387 transitions. Word has length 105 [2019-09-08 12:54:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:43,524 INFO L475 AbstractCegarLoop]: Abstraction has 17597 states and 27387 transitions. [2019-09-08 12:54:43,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:54:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 27387 transitions. [2019-09-08 12:54:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:54:43,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:43,526 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:43,527 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash -897759328, now seen corresponding path program 1 times [2019-09-08 12:54:43,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:43,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:43,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:43,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:43,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:43,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:54:43,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:54:43,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:43,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:54:43,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:54:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:54:43,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:54:43,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 12:54:43,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:54:43,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:54:43,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:54:43,846 INFO L87 Difference]: Start difference. First operand 17597 states and 27387 transitions. Second operand 8 states. [2019-09-08 12:54:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:45,681 INFO L93 Difference]: Finished difference Result 38269 states and 59768 transitions. [2019-09-08 12:54:45,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:54:45,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-09-08 12:54:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:45,714 INFO L225 Difference]: With dead ends: 38269 [2019-09-08 12:54:45,715 INFO L226 Difference]: Without dead ends: 27720 [2019-09-08 12:54:45,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:54:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27720 states. [2019-09-08 12:54:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27720 to 27082. [2019-09-08 12:54:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27082 states. [2019-09-08 12:54:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27082 states to 27082 states and 42229 transitions. [2019-09-08 12:54:47,046 INFO L78 Accepts]: Start accepts. Automaton has 27082 states and 42229 transitions. Word has length 107 [2019-09-08 12:54:47,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:47,046 INFO L475 AbstractCegarLoop]: Abstraction has 27082 states and 42229 transitions. [2019-09-08 12:54:47,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:54:47,046 INFO L276 IsEmpty]: Start isEmpty. Operand 27082 states and 42229 transitions. [2019-09-08 12:54:47,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:54:47,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:47,048 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:47,048 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:47,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1597113252, now seen corresponding path program 1 times [2019-09-08 12:54:47,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:47,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:47,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:47,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:54:47,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:47,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:54:47,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:54:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:54:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:54:47,207 INFO L87 Difference]: Start difference. First operand 27082 states and 42229 transitions. Second operand 4 states. [2019-09-08 12:54:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:49,547 INFO L93 Difference]: Finished difference Result 79756 states and 124206 transitions. [2019-09-08 12:54:49,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:54:49,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-08 12:54:49,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:49,610 INFO L225 Difference]: With dead ends: 79756 [2019-09-08 12:54:49,611 INFO L226 Difference]: Without dead ends: 52687 [2019-09-08 12:54:49,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:54:49,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52687 states. [2019-09-08 12:54:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52687 to 52685. [2019-09-08 12:54:52,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52685 states. [2019-09-08 12:54:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52685 states to 52685 states and 81498 transitions. [2019-09-08 12:54:52,283 INFO L78 Accepts]: Start accepts. Automaton has 52685 states and 81498 transitions. Word has length 108 [2019-09-08 12:54:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:52,283 INFO L475 AbstractCegarLoop]: Abstraction has 52685 states and 81498 transitions. [2019-09-08 12:54:52,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:54:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 52685 states and 81498 transitions. [2019-09-08 12:54:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:54:52,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:52,287 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:54:52,287 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1440328626, now seen corresponding path program 1 times [2019-09-08 12:54:52,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:52,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:52,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:52,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:54:52,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:52,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:54:52,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:54:52,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:54:52,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:52,329 INFO L87 Difference]: Start difference. First operand 52685 states and 81498 transitions. Second operand 3 states. [2019-09-08 12:54:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:58,059 INFO L93 Difference]: Finished difference Result 158009 states and 244424 transitions. [2019-09-08 12:54:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:54:58,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 12:54:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:58,411 INFO L225 Difference]: With dead ends: 158009 [2019-09-08 12:54:58,411 INFO L226 Difference]: Without dead ends: 105356 [2019-09-08 12:54:58,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:54:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105356 states. [2019-09-08 12:55:01,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105356 to 52687. [2019-09-08 12:55:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52687 states. [2019-09-08 12:55:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52687 states to 52687 states and 81500 transitions. [2019-09-08 12:55:01,587 INFO L78 Accepts]: Start accepts. Automaton has 52687 states and 81500 transitions. Word has length 109 [2019-09-08 12:55:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:01,587 INFO L475 AbstractCegarLoop]: Abstraction has 52687 states and 81500 transitions. [2019-09-08 12:55:01,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 52687 states and 81500 transitions. [2019-09-08 12:55:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:01,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:01,590 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:55:01,590 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:01,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2049070452, now seen corresponding path program 1 times [2019-09-08 12:55:01,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:01,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:01,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:55:01,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:01,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:01,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:01,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:01,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:01,640 INFO L87 Difference]: Start difference. First operand 52687 states and 81500 transitions. Second operand 3 states. [2019-09-08 12:55:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:05,605 INFO L93 Difference]: Finished difference Result 132699 states and 205552 transitions. [2019-09-08 12:55:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:05,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-08 12:55:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:05,724 INFO L225 Difference]: With dead ends: 132699 [2019-09-08 12:55:05,724 INFO L226 Difference]: Without dead ends: 80133 [2019-09-08 12:55:05,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80133 states. [2019-09-08 12:55:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80133 to 53171. [2019-09-08 12:55:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53171 states. [2019-09-08 12:55:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53171 states to 53171 states and 82223 transitions. [2019-09-08 12:55:10,605 INFO L78 Accepts]: Start accepts. Automaton has 53171 states and 82223 transitions. Word has length 110 [2019-09-08 12:55:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:10,606 INFO L475 AbstractCegarLoop]: Abstraction has 53171 states and 82223 transitions. [2019-09-08 12:55:10,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 53171 states and 82223 transitions. [2019-09-08 12:55:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:55:10,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:10,608 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:55:10,608 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1144401443, now seen corresponding path program 1 times [2019-09-08 12:55:10,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:10,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:10,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:10,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:10,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:10,707 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:55:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:55:10,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:55:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:55:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:55:10,709 INFO L87 Difference]: Start difference. First operand 53171 states and 82223 transitions. Second operand 4 states. [2019-09-08 12:55:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:17,716 INFO L93 Difference]: Finished difference Result 156531 states and 241705 transitions. [2019-09-08 12:55:17,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:55:17,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-08 12:55:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:17,857 INFO L225 Difference]: With dead ends: 156531 [2019-09-08 12:55:17,857 INFO L226 Difference]: Without dead ends: 103394 [2019-09-08 12:55:17,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:55:17,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103394 states. [2019-09-08 12:55:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103394 to 103392. [2019-09-08 12:55:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103392 states. [2019-09-08 12:55:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103392 states to 103392 states and 158558 transitions. [2019-09-08 12:55:24,038 INFO L78 Accepts]: Start accepts. Automaton has 103392 states and 158558 transitions. Word has length 110 [2019-09-08 12:55:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:24,038 INFO L475 AbstractCegarLoop]: Abstraction has 103392 states and 158558 transitions. [2019-09-08 12:55:24,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:55:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 103392 states and 158558 transitions. [2019-09-08 12:55:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:55:24,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:24,043 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:55:24,044 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash -437565009, now seen corresponding path program 1 times [2019-09-08 12:55:24,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:24,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:24,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:55:24,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:24,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:24,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:24,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:24,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:24,438 INFO L87 Difference]: Start difference. First operand 103392 states and 158558 transitions. Second operand 3 states. [2019-09-08 12:55:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:37,930 INFO L93 Difference]: Finished difference Result 310092 states and 475546 transitions. [2019-09-08 12:55:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:37,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-08 12:55:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:38,243 INFO L225 Difference]: With dead ends: 310092 [2019-09-08 12:55:38,243 INFO L226 Difference]: Without dead ends: 206748 [2019-09-08 12:55:38,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:38,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206748 states. [2019-09-08 12:55:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206748 to 103396. [2019-09-08 12:55:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103396 states. [2019-09-08 12:55:46,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103396 states to 103396 states and 158562 transitions. [2019-09-08 12:55:46,541 INFO L78 Accepts]: Start accepts. Automaton has 103396 states and 158562 transitions. Word has length 111 [2019-09-08 12:55:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:46,541 INFO L475 AbstractCegarLoop]: Abstraction has 103396 states and 158562 transitions. [2019-09-08 12:55:46,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:55:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 103396 states and 158562 transitions. [2019-09-08 12:55:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:55:46,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:46,545 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:55:46,545 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:46,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1133517964, now seen corresponding path program 1 times [2019-09-08 12:55:46,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:46,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:46,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:46,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 12:55:46,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:55:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:55:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:55:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:46,612 INFO L87 Difference]: Start difference. First operand 103396 states and 158562 transitions. Second operand 3 states. [2019-09-08 12:55:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:58,454 INFO L93 Difference]: Finished difference Result 256290 states and 392694 transitions. [2019-09-08 12:55:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:55:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:55:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:58,680 INFO L225 Difference]: With dead ends: 256290 [2019-09-08 12:55:58,680 INFO L226 Difference]: Without dead ends: 153166 [2019-09-08 12:55:58,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:55:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153166 states. [2019-09-08 12:56:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153166 to 104364. [2019-09-08 12:56:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104364 states. [2019-09-08 12:56:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104364 states to 104364 states and 160008 transitions. [2019-09-08 12:56:06,311 INFO L78 Accepts]: Start accepts. Automaton has 104364 states and 160008 transitions. Word has length 112 [2019-09-08 12:56:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:06,311 INFO L475 AbstractCegarLoop]: Abstraction has 104364 states and 160008 transitions. [2019-09-08 12:56:06,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 104364 states and 160008 transitions. [2019-09-08 12:56:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:56:06,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:06,314 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:56:06,314 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:06,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:06,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1659918376, now seen corresponding path program 1 times [2019-09-08 12:56:06,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:06,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:06,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:06,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:06,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:56:08,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:08,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:56:08,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:56:08,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:56:08,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:08,320 INFO L87 Difference]: Start difference. First operand 104364 states and 160008 transitions. Second operand 3 states. [2019-09-08 12:56:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:19,456 INFO L93 Difference]: Finished difference Result 279229 states and 427442 transitions. [2019-09-08 12:56:19,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:56:19,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 12:56:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:19,709 INFO L225 Difference]: With dead ends: 279229 [2019-09-08 12:56:19,709 INFO L226 Difference]: Without dead ends: 175189 [2019-09-08 12:56:19,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:56:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175189 states. [2019-09-08 12:56:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175189 to 175187. [2019-09-08 12:56:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175187 states. [2019-09-08 12:56:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175187 states to 175187 states and 265904 transitions. [2019-09-08 12:56:36,472 INFO L78 Accepts]: Start accepts. Automaton has 175187 states and 265904 transitions. Word has length 112 [2019-09-08 12:56:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:36,472 INFO L475 AbstractCegarLoop]: Abstraction has 175187 states and 265904 transitions. [2019-09-08 12:56:36,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:56:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 175187 states and 265904 transitions. [2019-09-08 12:56:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:56:36,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:36,478 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:56:36,478 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash -224555979, now seen corresponding path program 1 times [2019-09-08 12:56:36,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:36,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:36,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:56:36,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:36,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:56:36,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:56:36,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:56:36,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:36,586 INFO L87 Difference]: Start difference. First operand 175187 states and 265904 transitions. Second operand 4 states. [2019-09-08 12:56:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:51,963 INFO L93 Difference]: Finished difference Result 350772 states and 532250 transitions. [2019-09-08 12:56:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:56:51,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-08 12:56:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:52,233 INFO L225 Difference]: With dead ends: 350772 [2019-09-08 12:56:52,233 INFO L226 Difference]: Without dead ends: 175433 [2019-09-08 12:56:52,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:56:52,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175433 states. [2019-09-08 12:57:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175433 to 175431. [2019-09-08 12:57:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175431 states. [2019-09-08 12:57:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175431 states to 175431 states and 264816 transitions. [2019-09-08 12:57:06,258 INFO L78 Accepts]: Start accepts. Automaton has 175431 states and 264816 transitions. Word has length 112 [2019-09-08 12:57:06,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:06,258 INFO L475 AbstractCegarLoop]: Abstraction has 175431 states and 264816 transitions. [2019-09-08 12:57:06,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:57:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 175431 states and 264816 transitions. [2019-09-08 12:57:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:57:06,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:06,264 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:57:06,264 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1300532190, now seen corresponding path program 1 times [2019-09-08 12:57:06,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:06,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:57:06,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:06,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:57:06,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:57:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:57:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:57:06,371 INFO L87 Difference]: Start difference. First operand 175431 states and 264816 transitions. Second operand 4 states. [2019-09-08 12:57:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:21,177 INFO L93 Difference]: Finished difference Result 246218 states and 371228 transitions. [2019-09-08 12:57:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:57:21,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-08 12:57:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:21,428 INFO L225 Difference]: With dead ends: 246218 [2019-09-08 12:57:21,428 INFO L226 Difference]: Without dead ends: 175433 [2019-09-08 12:57:21,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:57:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175433 states. [2019-09-08 12:57:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175433 to 175187. [2019-09-08 12:57:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175187 states. [2019-09-08 12:57:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175187 states to 175187 states and 264522 transitions. [2019-09-08 12:57:40,204 INFO L78 Accepts]: Start accepts. Automaton has 175187 states and 264522 transitions. Word has length 112 [2019-09-08 12:57:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:40,204 INFO L475 AbstractCegarLoop]: Abstraction has 175187 states and 264522 transitions. [2019-09-08 12:57:40,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:57:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 175187 states and 264522 transitions. [2019-09-08 12:57:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:57:40,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:40,210 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:57:40,210 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:40,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:40,210 INFO L82 PathProgramCache]: Analyzing trace with hash -858599, now seen corresponding path program 1 times [2019-09-08 12:57:40,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:40,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:40,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:57:40,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:40,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:57:40,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:57:40,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:57:40,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:57:40,250 INFO L87 Difference]: Start difference. First operand 175187 states and 264522 transitions. Second operand 3 states. [2019-09-08 12:58:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:06,549 INFO L93 Difference]: Finished difference Result 421051 states and 635300 transitions. [2019-09-08 12:58:06,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:06,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-08 12:58:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:11,509 INFO L225 Difference]: With dead ends: 421051 [2019-09-08 12:58:11,509 INFO L226 Difference]: Without dead ends: 350266 [2019-09-08 12:58:11,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350266 states. [2019-09-08 12:58:27,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350266 to 175195. [2019-09-08 12:58:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175195 states. [2019-09-08 12:58:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175195 states to 175195 states and 264530 transitions. [2019-09-08 12:58:27,551 INFO L78 Accepts]: Start accepts. Automaton has 175195 states and 264530 transitions. Word has length 113 [2019-09-08 12:58:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:27,551 INFO L475 AbstractCegarLoop]: Abstraction has 175195 states and 264530 transitions. [2019-09-08 12:58:27,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:58:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 175195 states and 264530 transitions. [2019-09-08 12:58:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:58:27,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:27,557 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:58:27,557 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash 739385807, now seen corresponding path program 1 times [2019-09-08 12:58:27,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:27,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 12:58:27,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:58:27,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:58:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:58:27,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:27,621 INFO L87 Difference]: Start difference. First operand 175195 states and 264530 transitions. Second operand 3 states. [2019-09-08 12:58:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:51,667 INFO L93 Difference]: Finished difference Result 427960 states and 645648 transitions. [2019-09-08 12:58:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:58:51,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-08 12:58:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:52,037 INFO L225 Difference]: With dead ends: 427960 [2019-09-08 12:58:52,037 INFO L226 Difference]: Without dead ends: 253389 [2019-09-08 12:58:52,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:58:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253389 states. [2019-09-08 12:59:08,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253389 to 177131. [2019-09-08 12:59:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177131 states. [2019-09-08 12:59:08,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177131 states to 177131 states and 267422 transitions. [2019-09-08 12:59:08,514 INFO L78 Accepts]: Start accepts. Automaton has 177131 states and 267422 transitions. Word has length 114 [2019-09-08 12:59:08,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:08,515 INFO L475 AbstractCegarLoop]: Abstraction has 177131 states and 267422 transitions. [2019-09-08 12:59:08,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:59:08,515 INFO L276 IsEmpty]: Start isEmpty. Operand 177131 states and 267422 transitions. [2019-09-08 12:59:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 12:59:08,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:08,520 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 12:59:08,520 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1647857418, now seen corresponding path program 1 times [2019-09-08 12:59:08,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:59:08,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:08,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:59:08,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:59:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:59:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:59:08,618 INFO L87 Difference]: Start difference. First operand 177131 states and 267422 transitions. Second operand 4 states. [2019-09-08 12:59:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:40,891 INFO L93 Difference]: Finished difference Result 520329 states and 784495 transitions. [2019-09-08 12:59:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 12:59:40,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 12:59:40,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:41,473 INFO L225 Difference]: With dead ends: 520329 [2019-09-08 12:59:41,473 INFO L226 Difference]: Without dead ends: 343245 [2019-09-08 12:59:41,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:59:41,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343245 states. [2019-09-08 13:00:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343245 to 343243. [2019-09-08 13:00:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343243 states. [2019-09-08 13:00:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343243 states to 343243 states and 512822 transitions. [2019-09-08 13:00:18,753 INFO L78 Accepts]: Start accepts. Automaton has 343243 states and 512822 transitions. Word has length 114 [2019-09-08 13:00:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:18,753 INFO L475 AbstractCegarLoop]: Abstraction has 343243 states and 512822 transitions. [2019-09-08 13:00:18,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:00:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 343243 states and 512822 transitions. [2019-09-08 13:00:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 13:00:18,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:18,762 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 13:00:18,762 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -621974945, now seen corresponding path program 1 times [2019-09-08 13:00:18,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:00:18,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:18,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:00:18,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:00:18,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:00:18,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:00:18,918 INFO L87 Difference]: Start difference. First operand 343243 states and 512822 transitions. Second operand 4 states. [2019-09-08 13:00:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:57,883 INFO L93 Difference]: Finished difference Result 711193 states and 1062892 transitions. [2019-09-08 13:00:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:00:57,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 13:00:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:58,460 INFO L225 Difference]: With dead ends: 711193 [2019-09-08 13:00:58,460 INFO L226 Difference]: Without dead ends: 370181 [2019-09-08 13:00:58,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:00:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370181 states. [2019-09-08 13:01:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370181 to 369787. [2019-09-08 13:01:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369787 states. [2019-09-08 13:01:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369787 states to 369787 states and 549378 transitions. [2019-09-08 13:01:40,190 INFO L78 Accepts]: Start accepts. Automaton has 369787 states and 549378 transitions. Word has length 114 [2019-09-08 13:01:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:40,190 INFO L475 AbstractCegarLoop]: Abstraction has 369787 states and 549378 transitions. [2019-09-08 13:01:40,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:01:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 369787 states and 549378 transitions. [2019-09-08 13:01:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 13:01:40,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:40,197 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 13:01:40,197 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:40,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1493784559, now seen corresponding path program 1 times [2019-09-08 13:01:40,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:40,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:40,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:40,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 13:01:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:40,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:01:40,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:01:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:01:40,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:01:40,295 INFO L87 Difference]: Start difference. First operand 369787 states and 549378 transitions. Second operand 4 states. [2019-09-08 13:02:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:18,095 INFO L93 Difference]: Finished difference Result 715619 states and 1065798 transitions. [2019-09-08 13:02:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:02:18,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 13:02:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:18,725 INFO L225 Difference]: With dead ends: 715619 [2019-09-08 13:02:18,725 INFO L226 Difference]: Without dead ends: 352189 [2019-09-08 13:02:18,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:02:19,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352189 states. [2019-09-08 13:03:01,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352189 to 351963. [2019-09-08 13:03:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351963 states. [2019-09-08 13:03:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351963 states to 351963 states and 524214 transitions. [2019-09-08 13:03:01,822 INFO L78 Accepts]: Start accepts. Automaton has 351963 states and 524214 transitions. Word has length 114 [2019-09-08 13:03:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:03:01,822 INFO L475 AbstractCegarLoop]: Abstraction has 351963 states and 524214 transitions. [2019-09-08 13:03:01,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:03:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 351963 states and 524214 transitions. [2019-09-08 13:03:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:03:01,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:03:01,827 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 13:03:01,827 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:03:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:03:01,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1567350686, now seen corresponding path program 1 times [2019-09-08 13:03:01,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:03:01,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:03:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:03:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:03:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:03:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:03:01,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:03:01,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:03:01,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:03:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:03:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:03:01,888 INFO L87 Difference]: Start difference. First operand 351963 states and 524214 transitions. Second operand 3 states. [2019-09-08 13:04:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:04:09,887 INFO L93 Difference]: Finished difference Result 843525 states and 1261152 transitions. [2019-09-08 13:04:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:04:09,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 13:04:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:04:11,141 INFO L225 Difference]: With dead ends: 843525 [2019-09-08 13:04:11,142 INFO L226 Difference]: Without dead ends: 675999 [2019-09-08 13:04:11,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:04:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675999 states. [2019-09-08 13:05:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675999 to 674229. [2019-09-08 13:05:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674229 states. [2019-09-08 13:05:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674229 states to 674229 states and 1004424 transitions. [2019-09-08 13:05:25,998 INFO L78 Accepts]: Start accepts. Automaton has 674229 states and 1004424 transitions. Word has length 116 [2019-09-08 13:05:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:05:25,998 INFO L475 AbstractCegarLoop]: Abstraction has 674229 states and 1004424 transitions. [2019-09-08 13:05:25,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:05:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 674229 states and 1004424 transitions. [2019-09-08 13:05:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 13:05:26,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:05:26,003 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 13:05:26,004 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:05:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:05:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -480978613, now seen corresponding path program 1 times [2019-09-08 13:05:26,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:05:26,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:05:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:26,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:05:26,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:05:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:05:26,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 13:05:26,098 INFO L223 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) [2019-09-08 13:05:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 13:05:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:05:26,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 13:05:26,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 13:05:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 13:05:26,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 13:05:26,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 13:05:26,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:05:26,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:05:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:05:26,294 INFO L87 Difference]: Start difference. First operand 674229 states and 1004424 transitions. Second operand 10 states.