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_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:53:39,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:53:39,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:53:39,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:53:39,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:53:39,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:53:39,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:53:39,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:53:39,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:53:39,858 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:53:39,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:53:39,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:53:39,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:53:39,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:53:39,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:53:39,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:53:39,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:53:39,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:53:39,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:53:39,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:53:39,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:53:39,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:53:39,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:53:39,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:53:39,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:53:39,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:53:39,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:53:39,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:53:39,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:53:39,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:53:39,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:53:39,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:53:39,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:53:39,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:53:39,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:53:39,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:53:39,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:53:39,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:53:39,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:53:39,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:53:39,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:53:39,898 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 10:53:39,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:53:39,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:53:39,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:53:39,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:53:39,927 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:53:39,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:53:39,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:53:39,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:53:39,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:53:39,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:53:39,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:53:39,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:53:39,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:53:39,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:53:39,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:53:39,930 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:53:39,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:53:39,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:53:39,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:53:39,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:53:39,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:53:39,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:53:39,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:53:39,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:53:39,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:53:39,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:53:39,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:53:39,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:53:39,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:53:39,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:53:39,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:53:39,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:53:39,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:53:39,977 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:53:39,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:53:40,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21384fda/79949a3ea7d14896ba60121fcb0de29a/FLAG708502842 [2019-09-08 10:53:40,506 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:53:40,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:53:40,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21384fda/79949a3ea7d14896ba60121fcb0de29a/FLAG708502842 [2019-09-08 10:53:40,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c21384fda/79949a3ea7d14896ba60121fcb0de29a [2019-09-08 10:53:40,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:53:40,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:53:40,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:53:40,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:53:40,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:53:40,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:53:40" (1/1) ... [2019-09-08 10:53:40,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:40, skipping insertion in model container [2019-09-08 10:53:40,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:53:40" (1/1) ... [2019-09-08 10:53:40,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:53:40,972 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:53:41,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:53:41,378 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:53:41,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:53:41,498 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:53:41,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41 WrapperNode [2019-09-08 10:53:41,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:53:41,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:53:41,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:53:41,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:53:41,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (1/1) ... [2019-09-08 10:53:41,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:53:41,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:53:41,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:53:41,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:53:41,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (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 10:53:41,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:53:41,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:53:41,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:53:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:53:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:53:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:53:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:53:41,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:53:41,622 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:53:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:53:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:53:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:53:41,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:53:42,517 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:53:42,517 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:53:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:53:42 BoogieIcfgContainer [2019-09-08 10:53:42,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:53:42,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:53:42,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:53:42,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:53:42,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:53:40" (1/3) ... [2019-09-08 10:53:42,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75631009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:53:42, skipping insertion in model container [2019-09-08 10:53:42,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:53:41" (2/3) ... [2019-09-08 10:53:42,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75631009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:53:42, skipping insertion in model container [2019-09-08 10:53:42,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:53:42" (3/3) ... [2019-09-08 10:53:42,528 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-08 10:53:42,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:53:42,561 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:53:42,580 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:53:42,626 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:53:42,627 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:53:42,627 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:53:42,628 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:53:42,628 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:53:42,628 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:53:42,629 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:53:42,629 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:53:42,629 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:53:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-09-08 10:53:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:53:42,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:42,664 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 10:53:42,666 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1532024012, now seen corresponding path program 1 times [2019-09-08 10:53:42,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:42,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:42,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:42,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:43,257 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 10:53:43,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:43,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:53:43,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:53:43,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:53:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:43,282 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 7 states. [2019-09-08 10:53:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:43,946 INFO L93 Difference]: Finished difference Result 1158 states and 1835 transitions. [2019-09-08 10:53:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:53:43,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 10:53:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:43,986 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 10:53:43,986 INFO L226 Difference]: Without dead ends: 1025 [2019-09-08 10:53:43,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:53:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-09-08 10:53:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 515. [2019-09-08 10:53:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-09-08 10:53:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 790 transitions. [2019-09-08 10:53:44,144 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 790 transitions. Word has length 69 [2019-09-08 10:53:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:44,145 INFO L475 AbstractCegarLoop]: Abstraction has 515 states and 790 transitions. [2019-09-08 10:53:44,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:53:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 790 transitions. [2019-09-08 10:53:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:53:44,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:44,154 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 10:53:44,154 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash -525222683, now seen corresponding path program 1 times [2019-09-08 10:53:44,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:44,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:44,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:44,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:44,469 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 10:53:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:44,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:44,475 INFO L87 Difference]: Start difference. First operand 515 states and 790 transitions. Second operand 6 states. [2019-09-08 10:53:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:44,761 INFO L93 Difference]: Finished difference Result 1840 states and 2857 transitions. [2019-09-08 10:53:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:53:44,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:53:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:44,773 INFO L225 Difference]: With dead ends: 1840 [2019-09-08 10:53:44,773 INFO L226 Difference]: Without dead ends: 1392 [2019-09-08 10:53:44,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-08 10:53:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1386. [2019-09-08 10:53:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-09-08 10:53:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2132 transitions. [2019-09-08 10:53:44,883 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2132 transitions. Word has length 70 [2019-09-08 10:53:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:44,884 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 2132 transitions. [2019-09-08 10:53:44,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2132 transitions. [2019-09-08 10:53:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:53:44,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:44,892 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 10:53:44,892 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:44,893 INFO L82 PathProgramCache]: Analyzing trace with hash -550914758, now seen corresponding path program 1 times [2019-09-08 10:53:44,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:44,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:44,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:45,021 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 10:53:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:53:45,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:53:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:53:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:53:45,023 INFO L87 Difference]: Start difference. First operand 1386 states and 2132 transitions. Second operand 5 states. [2019-09-08 10:53:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:45,444 INFO L93 Difference]: Finished difference Result 3704 states and 5742 transitions. [2019-09-08 10:53:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:53:45,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:53:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:45,461 INFO L225 Difference]: With dead ends: 3704 [2019-09-08 10:53:45,461 INFO L226 Difference]: Without dead ends: 2357 [2019-09-08 10:53:45,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:53:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2019-09-08 10:53:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2355. [2019-09-08 10:53:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2019-09-08 10:53:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3620 transitions. [2019-09-08 10:53:45,612 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3620 transitions. Word has length 71 [2019-09-08 10:53:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:45,613 INFO L475 AbstractCegarLoop]: Abstraction has 2355 states and 3620 transitions. [2019-09-08 10:53:45,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:53:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3620 transitions. [2019-09-08 10:53:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:53:45,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:45,617 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 10:53:45,618 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127563, now seen corresponding path program 1 times [2019-09-08 10:53:45,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:45,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:45,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:45,805 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 10:53:45,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:45,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:45,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:45,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:45,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:45,808 INFO L87 Difference]: Start difference. First operand 2355 states and 3620 transitions. Second operand 6 states. [2019-09-08 10:53:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:46,463 INFO L93 Difference]: Finished difference Result 8694 states and 13413 transitions. [2019-09-08 10:53:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:53:46,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:53:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:46,495 INFO L225 Difference]: With dead ends: 8694 [2019-09-08 10:53:46,496 INFO L226 Difference]: Without dead ends: 6394 [2019-09-08 10:53:46,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:53:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6394 states. [2019-09-08 10:53:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6394 to 6390. [2019-09-08 10:53:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6390 states. [2019-09-08 10:53:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6390 states to 6390 states and 9804 transitions. [2019-09-08 10:53:46,913 INFO L78 Accepts]: Start accepts. Automaton has 6390 states and 9804 transitions. Word has length 71 [2019-09-08 10:53:46,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:46,915 INFO L475 AbstractCegarLoop]: Abstraction has 6390 states and 9804 transitions. [2019-09-08 10:53:46,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6390 states and 9804 transitions. [2019-09-08 10:53:46,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:53:46,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:46,918 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 10:53:46,918 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:46,918 INFO L82 PathProgramCache]: Analyzing trace with hash 968007085, now seen corresponding path program 1 times [2019-09-08 10:53:46,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:46,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:47,029 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 10:53:47,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:47,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:47,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:47,031 INFO L87 Difference]: Start difference. First operand 6390 states and 9804 transitions. Second operand 6 states. [2019-09-08 10:53:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:48,126 INFO L93 Difference]: Finished difference Result 23970 states and 36828 transitions. [2019-09-08 10:53:48,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:53:48,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:53:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:48,221 INFO L225 Difference]: With dead ends: 23970 [2019-09-08 10:53:48,222 INFO L226 Difference]: Without dead ends: 17685 [2019-09-08 10:53:48,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:53:48,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17685 states. [2019-09-08 10:53:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17685 to 15513. [2019-09-08 10:53:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15513 states. [2019-09-08 10:53:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15513 states to 15513 states and 23719 transitions. [2019-09-08 10:53:49,208 INFO L78 Accepts]: Start accepts. Automaton has 15513 states and 23719 transitions. Word has length 71 [2019-09-08 10:53:49,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:49,208 INFO L475 AbstractCegarLoop]: Abstraction has 15513 states and 23719 transitions. [2019-09-08 10:53:49,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 15513 states and 23719 transitions. [2019-09-08 10:53:49,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:53:49,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:49,212 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 10:53:49,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:49,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1314156252, now seen corresponding path program 1 times [2019-09-08 10:53:49,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:49,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:49,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:49,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:49,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:49,310 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 10:53:49,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:49,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:53:49,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:53:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:53:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:53:49,313 INFO L87 Difference]: Start difference. First operand 15513 states and 23719 transitions. Second operand 6 states. [2019-09-08 10:53:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:51,820 INFO L93 Difference]: Finished difference Result 59938 states and 91556 transitions. [2019-09-08 10:53:51,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:53:51,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:53:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:51,987 INFO L225 Difference]: With dead ends: 59938 [2019-09-08 10:53:51,988 INFO L226 Difference]: Without dead ends: 44503 [2019-09-08 10:53:52,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:53:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44503 states. [2019-09-08 10:53:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44503 to 44499. [2019-09-08 10:53:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44499 states. [2019-09-08 10:53:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44499 states to 44499 states and 67625 transitions. [2019-09-08 10:53:53,959 INFO L78 Accepts]: Start accepts. Automaton has 44499 states and 67625 transitions. Word has length 71 [2019-09-08 10:53:53,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:53,960 INFO L475 AbstractCegarLoop]: Abstraction has 44499 states and 67625 transitions. [2019-09-08 10:53:53,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:53:53,960 INFO L276 IsEmpty]: Start isEmpty. Operand 44499 states and 67625 transitions. [2019-09-08 10:53:53,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:53:53,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:53,965 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] [2019-09-08 10:53:53,965 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:53,965 INFO L82 PathProgramCache]: Analyzing trace with hash -791998800, now seen corresponding path program 1 times [2019-09-08 10:53:53,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:53,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:53,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:54,056 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 10:53:54,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:54,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:53:54,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:53:54,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:53:54,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:53:54,058 INFO L87 Difference]: Start difference. First operand 44499 states and 67625 transitions. Second operand 5 states. [2019-09-08 10:53:57,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:57,049 INFO L93 Difference]: Finished difference Result 73751 states and 111483 transitions. [2019-09-08 10:53:57,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:53:57,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 10:53:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:57,254 INFO L225 Difference]: With dead ends: 73751 [2019-09-08 10:53:57,254 INFO L226 Difference]: Without dead ends: 73749 [2019-09-08 10:53:57,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 10:53:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73749 states. [2019-09-08 10:53:59,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73749 to 45183. [2019-09-08 10:53:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45183 states. [2019-09-08 10:53:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45183 states to 45183 states and 68102 transitions. [2019-09-08 10:53:59,377 INFO L78 Accepts]: Start accepts. Automaton has 45183 states and 68102 transitions. Word has length 72 [2019-09-08 10:53:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:59,378 INFO L475 AbstractCegarLoop]: Abstraction has 45183 states and 68102 transitions. [2019-09-08 10:53:59,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:53:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45183 states and 68102 transitions. [2019-09-08 10:53:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:53:59,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:59,383 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] [2019-09-08 10:53:59,383 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:59,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1494388144, now seen corresponding path program 1 times [2019-09-08 10:53:59,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:59,466 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 10:53:59,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:59,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:53:59,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:53:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:53:59,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:53:59,468 INFO L87 Difference]: Start difference. First operand 45183 states and 68102 transitions. Second operand 4 states. [2019-09-08 10:54:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:02,746 INFO L93 Difference]: Finished difference Result 118177 states and 177598 transitions. [2019-09-08 10:54:02,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:54:02,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-09-08 10:54:02,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:02,880 INFO L225 Difference]: With dead ends: 118177 [2019-09-08 10:54:02,881 INFO L226 Difference]: Without dead ends: 73907 [2019-09-08 10:54:02,962 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 10:54:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73907 states. [2019-09-08 10:54:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73907 to 73905. [2019-09-08 10:54:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73905 states. [2019-09-08 10:54:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73905 states to 73905 states and 110408 transitions. [2019-09-08 10:54:07,728 INFO L78 Accepts]: Start accepts. Automaton has 73905 states and 110408 transitions. Word has length 73 [2019-09-08 10:54:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:07,728 INFO L475 AbstractCegarLoop]: Abstraction has 73905 states and 110408 transitions. [2019-09-08 10:54:07,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:54:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 73905 states and 110408 transitions. [2019-09-08 10:54:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:54:07,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:07,733 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 10:54:07,734 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1173196458, now seen corresponding path program 1 times [2019-09-08 10:54:07,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:07,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:07,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:07,861 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 10:54:07,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:07,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:54:07,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:54:07,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:54:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:54:07,863 INFO L87 Difference]: Start difference. First operand 73905 states and 110408 transitions. Second operand 7 states. [2019-09-08 10:54:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:21,075 INFO L93 Difference]: Finished difference Result 323332 states and 476357 transitions. [2019-09-08 10:54:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:54:21,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:54:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:21,468 INFO L225 Difference]: With dead ends: 323332 [2019-09-08 10:54:21,468 INFO L226 Difference]: Without dead ends: 261844 [2019-09-08 10:54:21,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:54:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261844 states. [2019-09-08 10:54:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261844 to 73935. [2019-09-08 10:54:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73935 states. [2019-09-08 10:54:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73935 states to 73935 states and 110444 transitions. [2019-09-08 10:54:26,674 INFO L78 Accepts]: Start accepts. Automaton has 73935 states and 110444 transitions. Word has length 74 [2019-09-08 10:54:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:26,674 INFO L475 AbstractCegarLoop]: Abstraction has 73935 states and 110444 transitions. [2019-09-08 10:54:26,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:54:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 73935 states and 110444 transitions. [2019-09-08 10:54:26,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:54:26,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:26,679 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 10:54:26,679 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:26,679 INFO L82 PathProgramCache]: Analyzing trace with hash 560209704, now seen corresponding path program 1 times [2019-09-08 10:54:26,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:26,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:26,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:26,731 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 10:54:26,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:26,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:54:26,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:54:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:54:26,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:26,732 INFO L87 Difference]: Start difference. First operand 73935 states and 110444 transitions. Second operand 3 states. [2019-09-08 10:54:33,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:33,548 INFO L93 Difference]: Finished difference Result 172617 states and 257808 transitions. [2019-09-08 10:54:33,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:33,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:54:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:33,722 INFO L225 Difference]: With dead ends: 172617 [2019-09-08 10:54:33,722 INFO L226 Difference]: Without dead ends: 108250 [2019-09-08 10:54:33,776 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 10:54:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108250 states. [2019-09-08 10:54:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108250 to 107041. [2019-09-08 10:54:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107041 states. [2019-09-08 10:54:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107041 states to 107041 states and 157894 transitions. [2019-09-08 10:54:39,578 INFO L78 Accepts]: Start accepts. Automaton has 107041 states and 157894 transitions. Word has length 74 [2019-09-08 10:54:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:39,578 INFO L475 AbstractCegarLoop]: Abstraction has 107041 states and 157894 transitions. [2019-09-08 10:54:39,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 107041 states and 157894 transitions. [2019-09-08 10:54:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:54:39,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:39,584 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 10:54:39,584 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:39,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:39,584 INFO L82 PathProgramCache]: Analyzing trace with hash 153092714, now seen corresponding path program 1 times [2019-09-08 10:54:39,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:39,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:39,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:39,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:39,653 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 10:54:39,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:39,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:54:39,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:54:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:54:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:54:39,654 INFO L87 Difference]: Start difference. First operand 107041 states and 157894 transitions. Second operand 3 states. [2019-09-08 10:54:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:48,075 INFO L93 Difference]: Finished difference Result 200720 states and 294994 transitions. [2019-09-08 10:54:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:54:48,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:54:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:48,278 INFO L225 Difference]: With dead ends: 200720 [2019-09-08 10:54:48,278 INFO L226 Difference]: Without dead ends: 131988 [2019-09-08 10:54:48,327 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 10:54:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131988 states. [2019-09-08 10:54:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131988 to 130369. [2019-09-08 10:54:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130369 states. [2019-09-08 10:54:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130369 states to 130369 states and 188810 transitions. [2019-09-08 10:54:55,952 INFO L78 Accepts]: Start accepts. Automaton has 130369 states and 188810 transitions. Word has length 74 [2019-09-08 10:54:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:55,952 INFO L475 AbstractCegarLoop]: Abstraction has 130369 states and 188810 transitions. [2019-09-08 10:54:55,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:54:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 130369 states and 188810 transitions. [2019-09-08 10:54:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:54:55,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:55,958 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 10:54:55,958 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 360963784, now seen corresponding path program 1 times [2019-09-08 10:54:55,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:55,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:55,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:55,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:56,048 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 10:54:56,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:56,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:54:56,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:54:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:54:56,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:54:56,051 INFO L87 Difference]: Start difference. First operand 130369 states and 188810 transitions. Second operand 7 states. [2019-09-08 10:55:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:43,275 INFO L93 Difference]: Finished difference Result 805730 states and 1159430 transitions. [2019-09-08 10:55:43,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:55:43,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:55:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:44,408 INFO L225 Difference]: With dead ends: 805730 [2019-09-08 10:55:44,408 INFO L226 Difference]: Without dead ends: 699698 [2019-09-08 10:55:44,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:55:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699698 states. [2019-09-08 10:56:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699698 to 130537. [2019-09-08 10:56:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130537 states. [2019-09-08 10:56:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130537 states to 130537 states and 189029 transitions. [2019-09-08 10:56:04,458 INFO L78 Accepts]: Start accepts. Automaton has 130537 states and 189029 transitions. Word has length 74 [2019-09-08 10:56:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:04,459 INFO L475 AbstractCegarLoop]: Abstraction has 130537 states and 189029 transitions. [2019-09-08 10:56:04,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:56:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 130537 states and 189029 transitions. [2019-09-08 10:56:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:04,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:04,464 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 10:56:04,465 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash -914256502, now seen corresponding path program 1 times [2019-09-08 10:56:04,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:04,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:04,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:04,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:04,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:04,515 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 10:56:04,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:04,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:56:04,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:56:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:56:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:56:04,518 INFO L87 Difference]: Start difference. First operand 130537 states and 189029 transitions. Second operand 3 states. [2019-09-08 10:56:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:19,339 INFO L93 Difference]: Finished difference Result 288159 states and 416370 transitions. [2019-09-08 10:56:19,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:56:19,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:56:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:19,584 INFO L225 Difference]: With dead ends: 288159 [2019-09-08 10:56:19,584 INFO L226 Difference]: Without dead ends: 167366 [2019-09-08 10:56:19,673 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 10:56:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167366 states. [2019-09-08 10:56:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167366 to 166666. [2019-09-08 10:56:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166666 states. [2019-09-08 10:56:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166666 states to 166666 states and 236734 transitions. [2019-09-08 10:56:33,226 INFO L78 Accepts]: Start accepts. Automaton has 166666 states and 236734 transitions. Word has length 74 [2019-09-08 10:56:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:33,227 INFO L475 AbstractCegarLoop]: Abstraction has 166666 states and 236734 transitions. [2019-09-08 10:56:33,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:56:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 166666 states and 236734 transitions. [2019-09-08 10:56:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:56:33,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:33,233 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 10:56:33,234 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1454128726, now seen corresponding path program 1 times [2019-09-08 10:56:33,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:33,312 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 10:56:33,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:33,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:56:33,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:56:33,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:56:33,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:56:33,313 INFO L87 Difference]: Start difference. First operand 166666 states and 236734 transitions. Second operand 7 states. [2019-09-08 10:57:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:46,770 INFO L93 Difference]: Finished difference Result 848380 states and 1196861 transitions. [2019-09-08 10:57:46,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:57:46,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-09-08 10:57:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:48,165 INFO L225 Difference]: With dead ends: 848380 [2019-09-08 10:57:48,165 INFO L226 Difference]: Without dead ends: 788860 [2019-09-08 10:57:48,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:57:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788860 states. [2019-09-08 10:58:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788860 to 166872. [2019-09-08 10:58:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166872 states. [2019-09-08 10:58:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166872 states to 166872 states and 236998 transitions. [2019-09-08 10:58:19,070 INFO L78 Accepts]: Start accepts. Automaton has 166872 states and 236998 transitions. Word has length 74 [2019-09-08 10:58:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:19,070 INFO L475 AbstractCegarLoop]: Abstraction has 166872 states and 236998 transitions. [2019-09-08 10:58:19,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:58:19,071 INFO L276 IsEmpty]: Start isEmpty. Operand 166872 states and 236998 transitions. [2019-09-08 10:58:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:58:19,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:19,076 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, 1] [2019-09-08 10:58:19,076 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:19,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash -776383725, now seen corresponding path program 1 times [2019-09-08 10:58:19,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:19,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:19,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:19,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:19,163 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 10:58:19,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:19,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:58:19,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:58:19,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:58:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:58:19,165 INFO L87 Difference]: Start difference. First operand 166872 states and 236998 transitions. Second operand 6 states. [2019-09-08 10:58:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:54,628 INFO L93 Difference]: Finished difference Result 417633 states and 594594 transitions. [2019-09-08 10:58:54,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:58:54,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:58:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:55,187 INFO L225 Difference]: With dead ends: 417633 [2019-09-08 10:58:55,187 INFO L226 Difference]: Without dead ends: 326801 [2019-09-08 10:58:55,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:58:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326801 states. [2019-09-08 10:59:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326801 to 191328. [2019-09-08 10:59:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191328 states. [2019-09-08 10:59:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191328 states to 191328 states and 272179 transitions. [2019-09-08 10:59:16,293 INFO L78 Accepts]: Start accepts. Automaton has 191328 states and 272179 transitions. Word has length 76 [2019-09-08 10:59:16,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:16,294 INFO L475 AbstractCegarLoop]: Abstraction has 191328 states and 272179 transitions. [2019-09-08 10:59:16,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:59:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 191328 states and 272179 transitions. [2019-09-08 10:59:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:59:16,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:16,300 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, 1] [2019-09-08 10:59:16,300 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2051604011, now seen corresponding path program 1 times [2019-09-08 10:59:16,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:16,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:16,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:16,386 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 10:59:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:16,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:16,388 INFO L87 Difference]: Start difference. First operand 191328 states and 272179 transitions. Second operand 6 states. [2019-09-08 10:59:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:54,298 INFO L93 Difference]: Finished difference Result 435336 states and 620123 transitions. [2019-09-08 10:59:54,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:59:54,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:59:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:54,855 INFO L225 Difference]: With dead ends: 435336 [2019-09-08 10:59:54,856 INFO L226 Difference]: Without dead ends: 340772 [2019-09-08 10:59:54,967 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340772 states. [2019-09-08 11:00:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340772 to 206263. [2019-09-08 11:00:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206263 states. [2019-09-08 11:00:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206263 states to 206263 states and 293590 transitions. [2019-09-08 11:00:23,206 INFO L78 Accepts]: Start accepts. Automaton has 206263 states and 293590 transitions. Word has length 76 [2019-09-08 11:00:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:23,207 INFO L475 AbstractCegarLoop]: Abstraction has 206263 states and 293590 transitions. [2019-09-08 11:00:23,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:00:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 206263 states and 293590 transitions. [2019-09-08 11:00:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:00:23,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:23,214 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, 1] [2019-09-08 11:00:23,215 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -793277035, now seen corresponding path program 1 times [2019-09-08 11:00:23,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:23,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:23,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:23,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:23,299 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 11:00:23,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:23,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:00:23,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:00:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:00:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:00:23,301 INFO L87 Difference]: Start difference. First operand 206263 states and 293590 transitions. Second operand 6 states. [2019-09-08 11:01:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:01,160 INFO L93 Difference]: Finished difference Result 413412 states and 588645 transitions. [2019-09-08 11:01:01,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:01:01,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 11:01:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:01,767 INFO L225 Difference]: With dead ends: 413412 [2019-09-08 11:01:01,767 INFO L226 Difference]: Without dead ends: 352370 [2019-09-08 11:01:01,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:01:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352370 states. [2019-09-08 11:01:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352370 to 231312. [2019-09-08 11:01:34,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231312 states. [2019-09-08 11:01:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231312 states to 231312 states and 329641 transitions. [2019-09-08 11:01:34,616 INFO L78 Accepts]: Start accepts. Automaton has 231312 states and 329641 transitions. Word has length 76 [2019-09-08 11:01:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:34,616 INFO L475 AbstractCegarLoop]: Abstraction has 231312 states and 329641 transitions. [2019-09-08 11:01:34,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:01:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 231312 states and 329641 transitions. [2019-09-08 11:01:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:01:34,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:34,626 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, 1, 1, 1, 1] [2019-09-08 11:01:34,626 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:34,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1975709726, now seen corresponding path program 1 times [2019-09-08 11:01:34,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:34,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:34,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:34,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:34,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:34,679 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 11:01:34,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:34,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:34,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:34,681 INFO L87 Difference]: Start difference. First operand 231312 states and 329641 transitions. Second operand 3 states. [2019-09-08 11:02:08,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:08,488 INFO L93 Difference]: Finished difference Result 371487 states and 526374 transitions. [2019-09-08 11:02:08,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:08,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:02:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:08,886 INFO L225 Difference]: With dead ends: 371487 [2019-09-08 11:02:08,886 INFO L226 Difference]: Without dead ends: 266378 [2019-09-08 11:02:08,969 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 11:02:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266378 states. [2019-09-08 11:02:36,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266378 to 235147. [2019-09-08 11:02:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235147 states. [2019-09-08 11:02:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235147 states to 235147 states and 330334 transitions. [2019-09-08 11:02:37,119 INFO L78 Accepts]: Start accepts. Automaton has 235147 states and 330334 transitions. Word has length 79 [2019-09-08 11:02:37,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:37,120 INFO L475 AbstractCegarLoop]: Abstraction has 235147 states and 330334 transitions. [2019-09-08 11:02:37,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 235147 states and 330334 transitions. [2019-09-08 11:02:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:02:37,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:37,130 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, 1, 1, 1, 1] [2019-09-08 11:02:37,130 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash 873902620, now seen corresponding path program 1 times [2019-09-08 11:02:37,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:37,223 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 11:02:37,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:37,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:37,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:37,225 INFO L87 Difference]: Start difference. First operand 235147 states and 330334 transitions. Second operand 7 states. [2019-09-08 11:04:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:58,751 INFO L93 Difference]: Finished difference Result 1028722 states and 1422420 transitions. [2019-09-08 11:04:58,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:04:58,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-09-08 11:04:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:00,442 INFO L225 Difference]: With dead ends: 1028722 [2019-09-08 11:05:00,442 INFO L226 Difference]: Without dead ends: 974689 [2019-09-08 11:05:00,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:05:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974689 states. [2019-09-08 11:05:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974689 to 235593. [2019-09-08 11:05:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235593 states. [2019-09-08 11:05:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235593 states to 235593 states and 330879 transitions. [2019-09-08 11:05:45,737 INFO L78 Accepts]: Start accepts. Automaton has 235593 states and 330879 transitions. Word has length 79 [2019-09-08 11:05:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:45,738 INFO L475 AbstractCegarLoop]: Abstraction has 235593 states and 330879 transitions. [2019-09-08 11:05:45,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:05:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 235593 states and 330879 transitions. [2019-09-08 11:05:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:05:45,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:45,750 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, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:45,750 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1233701679, now seen corresponding path program 1 times [2019-09-08 11:05:45,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:45,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:45,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:46,008 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 11:05:46,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:46,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 11:05:46,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 11:05:46,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 11:05:46,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:05:46,011 INFO L87 Difference]: Start difference. First operand 235593 states and 330879 transitions. Second operand 10 states.