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.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:18:37,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:18:37,943 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:18:37,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:18:37,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:18:37,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:18:37,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:18:37,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:18:37,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:18:37,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:18:37,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:18:37,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:18:37,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:18:37,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:18:37,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:18:37,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:18:37,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:18:37,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:18:37,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:18:37,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:18:37,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:18:37,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:18:37,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:18:37,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:18:37,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:18:37,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:18:37,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:18:37,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:18:37,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:18:37,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:18:37,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:18:37,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:18:37,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:18:37,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:18:37,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:18:37,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:18:37,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:18:37,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:18:37,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:18:37,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:18:37,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:18:37,990 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:18:38,005 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:18:38,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:18:38,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:18:38,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:18:38,007 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:18:38,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:18:38,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:18:38,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:18:38,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:18:38,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:18:38,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:18:38,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:18:38,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:18:38,010 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:18:38,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:18:38,010 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:18:38,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:18:38,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:18:38,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:18:38,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:18:38,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:18:38,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:18:38,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:18:38,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:18:38,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:18:38,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:18:38,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:18:38,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:18:38,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:18:38,060 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:18:38,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:18:38,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:18:38,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:18:38,077 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:18:38,078 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.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:18:38,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef3dc2e4/84c37208e7f740a7ab3379c8b5e9cbff/FLAG740407824 [2019-09-08 10:18:38,732 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:18:38,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:18:38,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef3dc2e4/84c37208e7f740a7ab3379c8b5e9cbff/FLAG740407824 [2019-09-08 10:18:38,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ef3dc2e4/84c37208e7f740a7ab3379c8b5e9cbff [2019-09-08 10:18:38,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:18:38,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:18:38,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:18:38,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:18:38,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:18:38,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:18:38" (1/1) ... [2019-09-08 10:18:39,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c3f56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:38, skipping insertion in model container [2019-09-08 10:18:39,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:18:38" (1/1) ... [2019-09-08 10:18:39,009 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:18:39,100 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:18:39,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:18:39,833 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:18:40,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:18:40,319 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:18:40,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40 WrapperNode [2019-09-08 10:18:40,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:18:40,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:18:40,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:18:40,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:18:40,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (1/1) ... [2019-09-08 10:18:40,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:18:40,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:18:40,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:18:40,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:18:40,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (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:18:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:18:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:18:40,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:18:40,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:18:40,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:18:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:18:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:18:40,584 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:18:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:18:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:18:40,585 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:18:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:18:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:18:40,586 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:18:40,587 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:18:40,588 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:18:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:18:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:18:40,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:18:42,661 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:18:42,662 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:18:42,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:18:42 BoogieIcfgContainer [2019-09-08 10:18:42,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:18:42,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:18:42,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:18:42,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:18:42,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:18:38" (1/3) ... [2019-09-08 10:18:42,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e3fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:18:42, skipping insertion in model container [2019-09-08 10:18:42,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:18:40" (2/3) ... [2019-09-08 10:18:42,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564e3fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:18:42, skipping insertion in model container [2019-09-08 10:18:42,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:18:42" (3/3) ... [2019-09-08 10:18:42,673 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 10:18:42,683 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:18:42,692 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-09-08 10:18:42,709 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-09-08 10:18:42,744 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:18:42,745 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:18:42,745 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:18:42,745 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:18:42,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:18:42,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:18:42,746 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:18:42,746 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:18:42,746 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:18:42,775 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states. [2019-09-08 10:18:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:18:42,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:42,792 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] [2019-09-08 10:18:42,795 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 769372493, now seen corresponding path program 1 times [2019-09-08 10:18:42,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:42,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:42,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:42,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:43,409 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:18:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:18:43,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:18:43,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:18:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:18:43,435 INFO L87 Difference]: Start difference. First operand 461 states. Second operand 5 states. [2019-09-08 10:18:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:44,175 INFO L93 Difference]: Finished difference Result 842 states and 1481 transitions. [2019-09-08 10:18:44,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:18:44,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-08 10:18:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:44,194 INFO L225 Difference]: With dead ends: 842 [2019-09-08 10:18:44,195 INFO L226 Difference]: Without dead ends: 489 [2019-09-08 10:18:44,201 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:18:44,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-09-08 10:18:44,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2019-09-08 10:18:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-09-08 10:18:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 657 transitions. [2019-09-08 10:18:44,293 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 657 transitions. Word has length 54 [2019-09-08 10:18:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:44,294 INFO L475 AbstractCegarLoop]: Abstraction has 483 states and 657 transitions. [2019-09-08 10:18:44,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:18:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 657 transitions. [2019-09-08 10:18:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:18:44,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:44,299 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] [2019-09-08 10:18:44,300 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash 861483672, now seen corresponding path program 1 times [2019-09-08 10:18:44,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:44,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:44,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:44,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:44,481 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:18:44,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:44,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:44,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:44,484 INFO L87 Difference]: Start difference. First operand 483 states and 657 transitions. Second operand 3 states. [2019-09-08 10:18:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:44,561 INFO L93 Difference]: Finished difference Result 1034 states and 1454 transitions. [2019-09-08 10:18:44,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:44,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:18:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:44,568 INFO L225 Difference]: With dead ends: 1034 [2019-09-08 10:18:44,568 INFO L226 Difference]: Without dead ends: 765 [2019-09-08 10:18:44,571 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:18:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-08 10:18:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 757. [2019-09-08 10:18:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-09-08 10:18:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1040 transitions. [2019-09-08 10:18:44,640 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1040 transitions. Word has length 55 [2019-09-08 10:18:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:44,640 INFO L475 AbstractCegarLoop]: Abstraction has 757 states and 1040 transitions. [2019-09-08 10:18:44,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1040 transitions. [2019-09-08 10:18:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:18:44,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:44,647 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] [2019-09-08 10:18:44,648 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:44,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash 481355333, now seen corresponding path program 1 times [2019-09-08 10:18:44,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:44,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:44,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:44,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:44,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:44,794 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:18:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:44,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:44,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:44,797 INFO L87 Difference]: Start difference. First operand 757 states and 1040 transitions. Second operand 3 states. [2019-09-08 10:18:44,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:44,889 INFO L93 Difference]: Finished difference Result 1527 states and 2181 transitions. [2019-09-08 10:18:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:44,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-08 10:18:44,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:44,905 INFO L225 Difference]: With dead ends: 1527 [2019-09-08 10:18:44,905 INFO L226 Difference]: Without dead ends: 1101 [2019-09-08 10:18:44,909 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:18:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-09-08 10:18:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1095. [2019-09-08 10:18:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-09-08 10:18:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1532 transitions. [2019-09-08 10:18:44,975 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1532 transitions. Word has length 55 [2019-09-08 10:18:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:44,977 INFO L475 AbstractCegarLoop]: Abstraction has 1095 states and 1532 transitions. [2019-09-08 10:18:44,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1532 transitions. [2019-09-08 10:18:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-08 10:18:44,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:44,980 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] [2019-09-08 10:18:44,980 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:44,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2053812510, now seen corresponding path program 1 times [2019-09-08 10:18:44,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:44,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:44,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:45,154 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:18:45,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:45,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:18:45,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:18:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:18:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:18:45,156 INFO L87 Difference]: Start difference. First operand 1095 states and 1532 transitions. Second operand 6 states. [2019-09-08 10:18:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:45,726 INFO L93 Difference]: Finished difference Result 2803 states and 4039 transitions. [2019-09-08 10:18:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:18:45,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-08 10:18:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:45,745 INFO L225 Difference]: With dead ends: 2803 [2019-09-08 10:18:45,746 INFO L226 Difference]: Without dead ends: 1883 [2019-09-08 10:18:45,750 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:18:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-09-08 10:18:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1863. [2019-09-08 10:18:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2019-09-08 10:18:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2690 transitions. [2019-09-08 10:18:45,885 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2690 transitions. Word has length 55 [2019-09-08 10:18:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:45,886 INFO L475 AbstractCegarLoop]: Abstraction has 1863 states and 2690 transitions. [2019-09-08 10:18:45,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:18:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2690 transitions. [2019-09-08 10:18:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:18:45,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:45,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] [2019-09-08 10:18:45,892 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash 287776612, now seen corresponding path program 1 times [2019-09-08 10:18:45,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:45,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:45,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:45,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:46,099 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:18:46,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:46,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:18:46,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:18:46,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:18:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:18:46,101 INFO L87 Difference]: Start difference. First operand 1863 states and 2690 transitions. Second operand 6 states. [2019-09-08 10:18:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:46,774 INFO L93 Difference]: Finished difference Result 6033 states and 8843 transitions. [2019-09-08 10:18:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:18:46,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-09-08 10:18:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:46,799 INFO L225 Difference]: With dead ends: 6033 [2019-09-08 10:18:46,799 INFO L226 Difference]: Without dead ends: 4345 [2019-09-08 10:18:46,803 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:18:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4345 states. [2019-09-08 10:18:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4345 to 4330. [2019-09-08 10:18:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4330 states. [2019-09-08 10:18:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 6303 transitions. [2019-09-08 10:18:47,048 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 6303 transitions. Word has length 56 [2019-09-08 10:18:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:47,049 INFO L475 AbstractCegarLoop]: Abstraction has 4330 states and 6303 transitions. [2019-09-08 10:18:47,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:18:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 6303 transitions. [2019-09-08 10:18:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 10:18:47,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:47,052 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] [2019-09-08 10:18:47,053 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 393817543, now seen corresponding path program 1 times [2019-09-08 10:18:47,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:47,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:47,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:47,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:47,122 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:18:47,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:47,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:47,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:47,124 INFO L87 Difference]: Start difference. First operand 4330 states and 6303 transitions. Second operand 3 states. [2019-09-08 10:18:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:47,544 INFO L93 Difference]: Finished difference Result 9878 states and 14536 transitions. [2019-09-08 10:18:47,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:47,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-08 10:18:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:47,578 INFO L225 Difference]: With dead ends: 9878 [2019-09-08 10:18:47,579 INFO L226 Difference]: Without dead ends: 6264 [2019-09-08 10:18:47,588 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:18:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-09-08 10:18:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 6217. [2019-09-08 10:18:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6217 states. [2019-09-08 10:18:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 8982 transitions. [2019-09-08 10:18:47,914 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 8982 transitions. Word has length 56 [2019-09-08 10:18:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:47,914 INFO L475 AbstractCegarLoop]: Abstraction has 6217 states and 8982 transitions. [2019-09-08 10:18:47,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 8982 transitions. [2019-09-08 10:18:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:18:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:47,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] [2019-09-08 10:18:47,919 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:47,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1900631734, now seen corresponding path program 1 times [2019-09-08 10:18:47,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:47,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:47,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:48,018 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:18:48,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:48,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:18:48,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:18:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:18:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:48,020 INFO L87 Difference]: Start difference. First operand 6217 states and 8982 transitions. Second operand 7 states. [2019-09-08 10:18:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:50,789 INFO L93 Difference]: Finished difference Result 29659 states and 43172 transitions. [2019-09-08 10:18:50,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:18:50,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:18:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:50,899 INFO L225 Difference]: With dead ends: 29659 [2019-09-08 10:18:50,900 INFO L226 Difference]: Without dead ends: 27264 [2019-09-08 10:18:50,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:18:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27264 states. [2019-09-08 10:18:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27264 to 6251. [2019-09-08 10:18:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6251 states. [2019-09-08 10:18:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6251 states to 6251 states and 9026 transitions. [2019-09-08 10:18:51,794 INFO L78 Accepts]: Start accepts. Automaton has 6251 states and 9026 transitions. Word has length 57 [2019-09-08 10:18:51,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:51,795 INFO L475 AbstractCegarLoop]: Abstraction has 6251 states and 9026 transitions. [2019-09-08 10:18:51,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 6251 states and 9026 transitions. [2019-09-08 10:18:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:18:51,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:51,800 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] [2019-09-08 10:18:51,801 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1596178184, now seen corresponding path program 1 times [2019-09-08 10:18:51,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:51,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:51,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:51,912 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:18:51,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:18:51,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:18:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:18:51,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:51,913 INFO L87 Difference]: Start difference. First operand 6251 states and 9026 transitions. Second operand 7 states. [2019-09-08 10:18:54,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:54,962 INFO L93 Difference]: Finished difference Result 23313 states and 33961 transitions. [2019-09-08 10:18:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:18:54,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:18:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:55,010 INFO L225 Difference]: With dead ends: 23313 [2019-09-08 10:18:55,010 INFO L226 Difference]: Without dead ends: 20808 [2019-09-08 10:18:55,022 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:18:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20808 states. [2019-09-08 10:18:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20808 to 6273. [2019-09-08 10:18:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6273 states. [2019-09-08 10:18:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 9057 transitions. [2019-09-08 10:18:55,850 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 9057 transitions. Word has length 57 [2019-09-08 10:18:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:55,850 INFO L475 AbstractCegarLoop]: Abstraction has 6273 states and 9057 transitions. [2019-09-08 10:18:55,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 9057 transitions. [2019-09-08 10:18:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:18:55,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:55,854 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] [2019-09-08 10:18:55,855 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:55,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash -728834285, now seen corresponding path program 1 times [2019-09-08 10:18:55,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:55,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:55,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:55,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:55,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:55,953 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:18:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:55,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:18:55,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:18:55,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:18:55,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:18:55,955 INFO L87 Difference]: Start difference. First operand 6273 states and 9057 transitions. Second operand 7 states. [2019-09-08 10:18:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:58,337 INFO L93 Difference]: Finished difference Result 20909 states and 30455 transitions. [2019-09-08 10:18:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:18:58,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-09-08 10:18:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:58,379 INFO L225 Difference]: With dead ends: 20909 [2019-09-08 10:18:58,379 INFO L226 Difference]: Without dead ends: 18141 [2019-09-08 10:18:58,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:18:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18141 states. [2019-09-08 10:18:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18141 to 6287. [2019-09-08 10:18:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2019-09-08 10:18:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 9075 transitions. [2019-09-08 10:18:59,168 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 9075 transitions. Word has length 57 [2019-09-08 10:18:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:59,169 INFO L475 AbstractCegarLoop]: Abstraction has 6287 states and 9075 transitions. [2019-09-08 10:18:59,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:18:59,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 9075 transitions. [2019-09-08 10:18:59,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:18:59,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:59,178 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] [2019-09-08 10:18:59,178 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:59,179 INFO L82 PathProgramCache]: Analyzing trace with hash -400384619, now seen corresponding path program 1 times [2019-09-08 10:18:59,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:59,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:59,382 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:18:59,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:59,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:18:59,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:18:59,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:18:59,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:18:59,384 INFO L87 Difference]: Start difference. First operand 6287 states and 9075 transitions. Second operand 9 states. [2019-09-08 10:19:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:02,521 INFO L93 Difference]: Finished difference Result 26937 states and 39469 transitions. [2019-09-08 10:19:02,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:19:02,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:19:02,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:02,575 INFO L225 Difference]: With dead ends: 26937 [2019-09-08 10:19:02,575 INFO L226 Difference]: Without dead ends: 22500 [2019-09-08 10:19:02,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:19:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22500 states. [2019-09-08 10:19:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22500 to 6253. [2019-09-08 10:19:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6253 states. [2019-09-08 10:19:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 9029 transitions. [2019-09-08 10:19:03,388 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 9029 transitions. Word has length 58 [2019-09-08 10:19:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:03,388 INFO L475 AbstractCegarLoop]: Abstraction has 6253 states and 9029 transitions. [2019-09-08 10:19:03,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:19:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 9029 transitions. [2019-09-08 10:19:03,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:19:03,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:03,393 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] [2019-09-08 10:19:03,394 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1454445203, now seen corresponding path program 1 times [2019-09-08 10:19:03,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:03,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:03,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:03,539 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:19:03,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:03,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:19:03,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:19:03,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:19:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:19:03,541 INFO L87 Difference]: Start difference. First operand 6253 states and 9029 transitions. Second operand 9 states. [2019-09-08 10:19:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:06,815 INFO L93 Difference]: Finished difference Result 22535 states and 33362 transitions. [2019-09-08 10:19:06,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:19:06,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 10:19:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:06,866 INFO L225 Difference]: With dead ends: 22535 [2019-09-08 10:19:06,866 INFO L226 Difference]: Without dead ends: 22530 [2019-09-08 10:19:06,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:19:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-09-08 10:19:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 6253. [2019-09-08 10:19:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6253 states. [2019-09-08 10:19:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 9027 transitions. [2019-09-08 10:19:08,345 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 9027 transitions. Word has length 58 [2019-09-08 10:19:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:08,345 INFO L475 AbstractCegarLoop]: Abstraction has 6253 states and 9027 transitions. [2019-09-08 10:19:08,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:19:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 9027 transitions. [2019-09-08 10:19:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:19:08,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:08,350 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] [2019-09-08 10:19:08,350 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash -780512958, now seen corresponding path program 1 times [2019-09-08 10:19:08,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:08,484 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:19:08,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:08,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:19:08,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:19:08,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:19:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:19:08,485 INFO L87 Difference]: Start difference. First operand 6253 states and 9027 transitions. Second operand 8 states. [2019-09-08 10:19:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:10,195 INFO L93 Difference]: Finished difference Result 16273 states and 23825 transitions. [2019-09-08 10:19:10,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:19:10,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-09-08 10:19:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:10,218 INFO L225 Difference]: With dead ends: 16273 [2019-09-08 10:19:10,218 INFO L226 Difference]: Without dead ends: 11458 [2019-09-08 10:19:10,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:19:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2019-09-08 10:19:11,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6088. [2019-09-08 10:19:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-08 10:19:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8805 transitions. [2019-09-08 10:19:11,168 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8805 transitions. Word has length 58 [2019-09-08 10:19:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:11,168 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8805 transitions. [2019-09-08 10:19:11,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:19:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8805 transitions. [2019-09-08 10:19:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:19:11,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:11,172 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] [2019-09-08 10:19:11,173 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1313400580, now seen corresponding path program 1 times [2019-09-08 10:19:11,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:11,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:11,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:11,246 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:19:11,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:11,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:11,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:11,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:11,248 INFO L87 Difference]: Start difference. First operand 6088 states and 8805 transitions. Second operand 3 states. [2019-09-08 10:19:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:12,071 INFO L93 Difference]: Finished difference Result 8890 states and 12910 transitions. [2019-09-08 10:19:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:12,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:19:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:12,088 INFO L225 Difference]: With dead ends: 8890 [2019-09-08 10:19:12,092 INFO L226 Difference]: Without dead ends: 6094 [2019-09-08 10:19:12,102 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:19:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2019-09-08 10:19:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 6088. [2019-09-08 10:19:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-08 10:19:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8713 transitions. [2019-09-08 10:19:12,682 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8713 transitions. Word has length 59 [2019-09-08 10:19:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:12,682 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8713 transitions. [2019-09-08 10:19:12,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8713 transitions. [2019-09-08 10:19:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:19:12,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:12,688 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] [2019-09-08 10:19:12,688 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:12,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:12,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1203643884, now seen corresponding path program 1 times [2019-09-08 10:19:12,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:12,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:12,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:12,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:12,748 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:19:12,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:12,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:12,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:12,749 INFO L87 Difference]: Start difference. First operand 6088 states and 8713 transitions. Second operand 3 states. [2019-09-08 10:19:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:13,445 INFO L93 Difference]: Finished difference Result 8817 states and 12670 transitions. [2019-09-08 10:19:13,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:13,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:19:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:13,455 INFO L225 Difference]: With dead ends: 8817 [2019-09-08 10:19:13,455 INFO L226 Difference]: Without dead ends: 6095 [2019-09-08 10:19:13,460 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:19:13,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-09-08 10:19:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 6088. [2019-09-08 10:19:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6088 states. [2019-09-08 10:19:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8613 transitions. [2019-09-08 10:19:14,358 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8613 transitions. Word has length 59 [2019-09-08 10:19:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:14,359 INFO L475 AbstractCegarLoop]: Abstraction has 6088 states and 8613 transitions. [2019-09-08 10:19:14,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8613 transitions. [2019-09-08 10:19:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:19:14,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:14,364 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] [2019-09-08 10:19:14,364 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash 776650189, now seen corresponding path program 1 times [2019-09-08 10:19:14,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:14,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:14,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:14,451 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:19:14,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:14,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:14,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:14,453 INFO L87 Difference]: Start difference. First operand 6088 states and 8613 transitions. Second operand 3 states. [2019-09-08 10:19:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:15,136 INFO L93 Difference]: Finished difference Result 8609 states and 12165 transitions. [2019-09-08 10:19:15,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:15,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-09-08 10:19:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:15,144 INFO L225 Difference]: With dead ends: 8609 [2019-09-08 10:19:15,144 INFO L226 Difference]: Without dead ends: 6054 [2019-09-08 10:19:15,150 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:19:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6054 states. [2019-09-08 10:19:15,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6054 to 6048. [2019-09-08 10:19:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6048 states. [2019-09-08 10:19:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6048 states to 6048 states and 8386 transitions. [2019-09-08 10:19:15,665 INFO L78 Accepts]: Start accepts. Automaton has 6048 states and 8386 transitions. Word has length 59 [2019-09-08 10:19:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:15,666 INFO L475 AbstractCegarLoop]: Abstraction has 6048 states and 8386 transitions. [2019-09-08 10:19:15,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6048 states and 8386 transitions. [2019-09-08 10:19:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:19:15,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:15,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:15,669 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1527639271, now seen corresponding path program 1 times [2019-09-08 10:19:15,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:15,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:15,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:15,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:15,716 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:19:15,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:15,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:15,718 INFO L87 Difference]: Start difference. First operand 6048 states and 8386 transitions. Second operand 3 states. [2019-09-08 10:19:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:16,682 INFO L93 Difference]: Finished difference Result 9770 states and 13643 transitions. [2019-09-08 10:19:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:16,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-08 10:19:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:16,689 INFO L225 Difference]: With dead ends: 9770 [2019-09-08 10:19:16,689 INFO L226 Difference]: Without dead ends: 7046 [2019-09-08 10:19:16,695 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:19:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states. [2019-09-08 10:19:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 5667. [2019-09-08 10:19:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5667 states. [2019-09-08 10:19:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5667 states to 5667 states and 7880 transitions. [2019-09-08 10:19:17,218 INFO L78 Accepts]: Start accepts. Automaton has 5667 states and 7880 transitions. Word has length 60 [2019-09-08 10:19:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:17,219 INFO L475 AbstractCegarLoop]: Abstraction has 5667 states and 7880 transitions. [2019-09-08 10:19:17,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5667 states and 7880 transitions. [2019-09-08 10:19:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:17,222 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:17,222 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] [2019-09-08 10:19:17,222 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:17,222 INFO L82 PathProgramCache]: Analyzing trace with hash -306322079, now seen corresponding path program 1 times [2019-09-08 10:19:17,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:17,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:17,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:17,270 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:19:17,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:17,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:17,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:17,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:17,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:17,272 INFO L87 Difference]: Start difference. First operand 5667 states and 7880 transitions. Second operand 3 states. [2019-09-08 10:19:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:18,033 INFO L93 Difference]: Finished difference Result 11083 states and 15579 transitions. [2019-09-08 10:19:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:18,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:19:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:18,042 INFO L225 Difference]: With dead ends: 11083 [2019-09-08 10:19:18,042 INFO L226 Difference]: Without dead ends: 7955 [2019-09-08 10:19:18,048 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:19:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2019-09-08 10:19:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 5606. [2019-09-08 10:19:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5606 states. [2019-09-08 10:19:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5606 states to 5606 states and 7788 transitions. [2019-09-08 10:19:18,702 INFO L78 Accepts]: Start accepts. Automaton has 5606 states and 7788 transitions. Word has length 61 [2019-09-08 10:19:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:18,702 INFO L475 AbstractCegarLoop]: Abstraction has 5606 states and 7788 transitions. [2019-09-08 10:19:18,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5606 states and 7788 transitions. [2019-09-08 10:19:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:18,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:18,704 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] [2019-09-08 10:19:18,705 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1076067543, now seen corresponding path program 1 times [2019-09-08 10:19:18,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:18,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:18,752 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:19:18,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:18,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:18,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:18,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:18,753 INFO L87 Difference]: Start difference. First operand 5606 states and 7788 transitions. Second operand 3 states. [2019-09-08 10:19:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:20,097 INFO L93 Difference]: Finished difference Result 10973 states and 15399 transitions. [2019-09-08 10:19:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:20,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 10:19:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:20,106 INFO L225 Difference]: With dead ends: 10973 [2019-09-08 10:19:20,106 INFO L226 Difference]: Without dead ends: 7868 [2019-09-08 10:19:20,111 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:19:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-09-08 10:19:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 5517. [2019-09-08 10:19:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5517 states. [2019-09-08 10:19:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 7664 transitions. [2019-09-08 10:19:20,740 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 7664 transitions. Word has length 61 [2019-09-08 10:19:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:20,740 INFO L475 AbstractCegarLoop]: Abstraction has 5517 states and 7664 transitions. [2019-09-08 10:19:20,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 7664 transitions. [2019-09-08 10:19:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:20,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:20,742 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] [2019-09-08 10:19:20,743 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash -69771348, now seen corresponding path program 1 times [2019-09-08 10:19:20,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:20,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:20,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:20,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:20,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:21,222 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:19:21,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:21,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:19:21,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:19:21,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:19:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:19:21,223 INFO L87 Difference]: Start difference. First operand 5517 states and 7664 transitions. Second operand 13 states. [2019-09-08 10:19:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:23,692 INFO L93 Difference]: Finished difference Result 7865 states and 11005 transitions. [2019-09-08 10:19:23,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:19:23,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-08 10:19:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:23,700 INFO L225 Difference]: With dead ends: 7865 [2019-09-08 10:19:23,701 INFO L226 Difference]: Without dead ends: 7861 [2019-09-08 10:19:23,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:19:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7861 states. [2019-09-08 10:19:24,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7861 to 5513. [2019-09-08 10:19:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5513 states. [2019-09-08 10:19:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 7659 transitions. [2019-09-08 10:19:24,383 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 7659 transitions. Word has length 61 [2019-09-08 10:19:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:24,383 INFO L475 AbstractCegarLoop]: Abstraction has 5513 states and 7659 transitions. [2019-09-08 10:19:24,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:19:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 7659 transitions. [2019-09-08 10:19:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:24,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:24,386 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] [2019-09-08 10:19:24,386 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:24,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1711838127, now seen corresponding path program 1 times [2019-09-08 10:19:24,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:24,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:24,797 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:19:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:19:24,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:19:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:19:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:19:24,799 INFO L87 Difference]: Start difference. First operand 5513 states and 7659 transitions. Second operand 12 states. [2019-09-08 10:19:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:27,447 INFO L93 Difference]: Finished difference Result 10529 states and 14791 transitions. [2019-09-08 10:19:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:19:27,447 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2019-09-08 10:19:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:27,458 INFO L225 Difference]: With dead ends: 10529 [2019-09-08 10:19:27,459 INFO L226 Difference]: Without dead ends: 10158 [2019-09-08 10:19:27,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:19:27,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10158 states. [2019-09-08 10:19:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10158 to 5512. [2019-09-08 10:19:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-09-08 10:19:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 7657 transitions. [2019-09-08 10:19:28,194 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 7657 transitions. Word has length 61 [2019-09-08 10:19:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:28,195 INFO L475 AbstractCegarLoop]: Abstraction has 5512 states and 7657 transitions. [2019-09-08 10:19:28,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:19:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 7657 transitions. [2019-09-08 10:19:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:28,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:28,197 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] [2019-09-08 10:19:28,197 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:28,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1267518257, now seen corresponding path program 1 times [2019-09-08 10:19:28,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:28,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:28,924 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:19:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:19:28,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:19:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:19:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:19:28,926 INFO L87 Difference]: Start difference. First operand 5512 states and 7657 transitions. Second operand 16 states. [2019-09-08 10:19:29,331 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-09-08 10:19:29,547 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2019-09-08 10:19:29,726 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 10:19:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:33,032 INFO L93 Difference]: Finished difference Result 10060 states and 14146 transitions. [2019-09-08 10:19:33,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:19:33,032 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 61 [2019-09-08 10:19:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:33,043 INFO L225 Difference]: With dead ends: 10060 [2019-09-08 10:19:33,043 INFO L226 Difference]: Without dead ends: 10054 [2019-09-08 10:19:33,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:19:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10054 states. [2019-09-08 10:19:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10054 to 5512. [2019-09-08 10:19:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-09-08 10:19:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 7656 transitions. [2019-09-08 10:19:33,853 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 7656 transitions. Word has length 61 [2019-09-08 10:19:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:33,854 INFO L475 AbstractCegarLoop]: Abstraction has 5512 states and 7656 transitions. [2019-09-08 10:19:33,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:19:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 7656 transitions. [2019-09-08 10:19:33,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:19:33,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:33,856 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] [2019-09-08 10:19:33,856 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:33,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:33,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1890999092, now seen corresponding path program 1 times [2019-09-08 10:19:33,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:33,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:34,431 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:19:34,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:34,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 10:19:34,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 10:19:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 10:19:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-08 10:19:34,435 INFO L87 Difference]: Start difference. First operand 5512 states and 7656 transitions. Second operand 14 states. [2019-09-08 10:19:35,142 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-08 10:19:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:40,538 INFO L93 Difference]: Finished difference Result 18230 states and 25718 transitions. [2019-09-08 10:19:40,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:19:40,540 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-09-08 10:19:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:40,565 INFO L225 Difference]: With dead ends: 18230 [2019-09-08 10:19:40,565 INFO L226 Difference]: Without dead ends: 17796 [2019-09-08 10:19:40,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:19:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17796 states. [2019-09-08 10:19:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17796 to 5484. [2019-09-08 10:19:41,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5484 states. [2019-09-08 10:19:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7624 transitions. [2019-09-08 10:19:41,670 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7624 transitions. Word has length 61 [2019-09-08 10:19:41,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:41,670 INFO L475 AbstractCegarLoop]: Abstraction has 5484 states and 7624 transitions. [2019-09-08 10:19:41,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 10:19:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7624 transitions. [2019-09-08 10:19:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-08 10:19:41,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:41,672 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:41,673 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:41,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:41,673 INFO L82 PathProgramCache]: Analyzing trace with hash -171028691, now seen corresponding path program 1 times [2019-09-08 10:19:41,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:41,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:41,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:42,051 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:19:42,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:42,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 10:19:42,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 10:19:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 10:19:42,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:19:42,052 INFO L87 Difference]: Start difference. First operand 5484 states and 7624 transitions. Second operand 11 states. [2019-09-08 10:19:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:45,305 INFO L93 Difference]: Finished difference Result 10652 states and 14989 transitions. [2019-09-08 10:19:45,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 10:19:45,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-09-08 10:19:45,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:45,318 INFO L225 Difference]: With dead ends: 10652 [2019-09-08 10:19:45,318 INFO L226 Difference]: Without dead ends: 10648 [2019-09-08 10:19:45,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-09-08 10:19:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10648 states. [2019-09-08 10:19:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10648 to 5480. [2019-09-08 10:19:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2019-09-08 10:19:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 7620 transitions. [2019-09-08 10:19:46,413 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 7620 transitions. Word has length 62 [2019-09-08 10:19:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:46,413 INFO L475 AbstractCegarLoop]: Abstraction has 5480 states and 7620 transitions. [2019-09-08 10:19:46,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 10:19:46,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 7620 transitions. [2019-09-08 10:19:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:19:46,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:46,417 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:19:46,417 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:46,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:46,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1643195361, now seen corresponding path program 1 times [2019-09-08 10:19:46,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:46,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:46,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:46,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:46,501 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:19:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:46,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:19:46,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:19:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:19:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:19:46,508 INFO L87 Difference]: Start difference. First operand 5480 states and 7620 transitions. Second operand 6 states. [2019-09-08 10:19:50,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:50,300 INFO L93 Difference]: Finished difference Result 22964 states and 32541 transitions. [2019-09-08 10:19:50,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:19:50,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:19:50,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:50,324 INFO L225 Difference]: With dead ends: 22964 [2019-09-08 10:19:50,324 INFO L226 Difference]: Without dead ends: 18877 [2019-09-08 10:19:50,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:19:50,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18877 states. [2019-09-08 10:19:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18877 to 14493. [2019-09-08 10:19:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14493 states. [2019-09-08 10:19:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 20083 transitions. [2019-09-08 10:19:53,157 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 20083 transitions. Word has length 70 [2019-09-08 10:19:53,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:53,158 INFO L475 AbstractCegarLoop]: Abstraction has 14493 states and 20083 transitions. [2019-09-08 10:19:53,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:19:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 20083 transitions. [2019-09-08 10:19:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:19:53,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:53,164 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:19:53,164 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2116581710, now seen corresponding path program 1 times [2019-09-08 10:19:53,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:53,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:53,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:53,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:19:53,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:53,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:53,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:53,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:53,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:53,259 INFO L87 Difference]: Start difference. First operand 14493 states and 20083 transitions. Second operand 5 states. [2019-09-08 10:19:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:56,170 INFO L93 Difference]: Finished difference Result 14499 states and 20086 transitions. [2019-09-08 10:19:56,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:19:56,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 10:19:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:56,183 INFO L225 Difference]: With dead ends: 14499 [2019-09-08 10:19:56,184 INFO L226 Difference]: Without dead ends: 13677 [2019-09-08 10:19:56,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13677 states. [2019-09-08 10:19:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13677 to 13673. [2019-09-08 10:19:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13673 states. [2019-09-08 10:19:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13673 states to 13673 states and 18982 transitions. [2019-09-08 10:19:58,841 INFO L78 Accepts]: Start accepts. Automaton has 13673 states and 18982 transitions. Word has length 71 [2019-09-08 10:19:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:58,841 INFO L475 AbstractCegarLoop]: Abstraction has 13673 states and 18982 transitions. [2019-09-08 10:19:58,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:19:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13673 states and 18982 transitions. [2019-09-08 10:19:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:19:58,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:58,847 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:19:58,847 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:58,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:58,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1570673773, now seen corresponding path program 1 times [2019-09-08 10:19:58,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:58,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:58,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:58,930 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:19:58,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:58,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:19:58,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:19:58,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:19:58,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:19:58,932 INFO L87 Difference]: Start difference. First operand 13673 states and 18982 transitions. Second operand 6 states. [2019-09-08 10:20:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:05,048 INFO L93 Difference]: Finished difference Result 25303 states and 34666 transitions. [2019-09-08 10:20:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:20:05,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:20:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:05,081 INFO L225 Difference]: With dead ends: 25303 [2019-09-08 10:20:05,081 INFO L226 Difference]: Without dead ends: 25301 [2019-09-08 10:20:05,087 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:20:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25301 states. [2019-09-08 10:20:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25301 to 14003. [2019-09-08 10:20:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14003 states. [2019-09-08 10:20:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14003 states to 14003 states and 19202 transitions. [2019-09-08 10:20:08,036 INFO L78 Accepts]: Start accepts. Automaton has 14003 states and 19202 transitions. Word has length 72 [2019-09-08 10:20:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:08,036 INFO L475 AbstractCegarLoop]: Abstraction has 14003 states and 19202 transitions. [2019-09-08 10:20:08,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:20:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 14003 states and 19202 transitions. [2019-09-08 10:20:08,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:20:08,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:08,045 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:20:08,045 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:08,046 INFO L82 PathProgramCache]: Analyzing trace with hash -274929820, now seen corresponding path program 1 times [2019-09-08 10:20:08,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:08,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:08,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:08,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:08,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:08,102 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:20:08,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:08,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:08,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:08,104 INFO L87 Difference]: Start difference. First operand 14003 states and 19202 transitions. Second operand 3 states. [2019-09-08 10:20:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:13,486 INFO L93 Difference]: Finished difference Result 36586 states and 50284 transitions. [2019-09-08 10:20:13,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:13,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 10:20:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:13,513 INFO L225 Difference]: With dead ends: 36586 [2019-09-08 10:20:13,513 INFO L226 Difference]: Without dead ends: 23775 [2019-09-08 10:20:13,528 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:20:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23775 states. [2019-09-08 10:20:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23775 to 23483. [2019-09-08 10:20:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23483 states. [2019-09-08 10:20:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23483 states to 23483 states and 31744 transitions. [2019-09-08 10:20:18,441 INFO L78 Accepts]: Start accepts. Automaton has 23483 states and 31744 transitions. Word has length 73 [2019-09-08 10:20:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:18,442 INFO L475 AbstractCegarLoop]: Abstraction has 23483 states and 31744 transitions. [2019-09-08 10:20:18,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:20:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23483 states and 31744 transitions. [2019-09-08 10:20:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:20:18,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:18,452 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:20:18,452 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash 61383844, now seen corresponding path program 1 times [2019-09-08 10:20:18,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:18,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:18,518 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:20:18,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:20:18,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:20:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:20:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:20:18,519 INFO L87 Difference]: Start difference. First operand 23483 states and 31744 transitions. Second operand 5 states. [2019-09-08 10:20:35,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:35,126 INFO L93 Difference]: Finished difference Result 92224 states and 124755 transitions. [2019-09-08 10:20:35,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:20:35,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-09-08 10:20:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:35,219 INFO L225 Difference]: With dead ends: 92224 [2019-09-08 10:20:35,220 INFO L226 Difference]: Without dead ends: 70130 [2019-09-08 10:20:35,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:20:35,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70130 states. [2019-09-08 10:20:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70130 to 37719. [2019-09-08 10:20:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37719 states. [2019-09-08 10:20:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37719 states to 37719 states and 50333 transitions. [2019-09-08 10:20:44,822 INFO L78 Accepts]: Start accepts. Automaton has 37719 states and 50333 transitions. Word has length 74 [2019-09-08 10:20:44,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:44,822 INFO L475 AbstractCegarLoop]: Abstraction has 37719 states and 50333 transitions. [2019-09-08 10:20:44,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:20:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37719 states and 50333 transitions. [2019-09-08 10:20:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:20:44,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:44,830 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:20:44,831 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1329668181, now seen corresponding path program 1 times [2019-09-08 10:20:44,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:44,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:44,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:44,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:44,881 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:20:44,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:44,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:20:44,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:20:44,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:20:44,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:20:44,883 INFO L87 Difference]: Start difference. First operand 37719 states and 50333 transitions. Second operand 3 states. [2019-09-08 10:20:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:53,270 INFO L93 Difference]: Finished difference Result 73523 states and 97861 transitions. [2019-09-08 10:20:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:20:53,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:20:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:53,315 INFO L225 Difference]: With dead ends: 73523 [2019-09-08 10:20:53,316 INFO L226 Difference]: Without dead ends: 36909 [2019-09-08 10:20:53,349 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:20:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36909 states. [2019-09-08 10:21:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36909 to 36637. [2019-09-08 10:21:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36637 states. [2019-09-08 10:21:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36637 states to 36637 states and 47983 transitions. [2019-09-08 10:21:01,428 INFO L78 Accepts]: Start accepts. Automaton has 36637 states and 47983 transitions. Word has length 74 [2019-09-08 10:21:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:01,428 INFO L475 AbstractCegarLoop]: Abstraction has 36637 states and 47983 transitions. [2019-09-08 10:21:01,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:21:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36637 states and 47983 transitions. [2019-09-08 10:21:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:21:01,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:01,435 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] [2019-09-08 10:21:01,436 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:01,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash 458779300, now seen corresponding path program 1 times [2019-09-08 10:21:01,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:01,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:01,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:01,502 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:21:01,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:01,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:21:01,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:21:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:21:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:21:01,504 INFO L87 Difference]: Start difference. First operand 36637 states and 47983 transitions. Second operand 5 states. [2019-09-08 10:21:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:30,780 INFO L93 Difference]: Finished difference Result 154549 states and 201929 transitions. [2019-09-08 10:21:30,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:21:30,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-08 10:21:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:30,955 INFO L225 Difference]: With dead ends: 154549 [2019-09-08 10:21:30,955 INFO L226 Difference]: Without dead ends: 119017 [2019-09-08 10:21:31,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:21:31,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119017 states. [2019-09-08 10:21:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119017 to 71241. [2019-09-08 10:21:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71241 states. [2019-09-08 10:21:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71241 states to 71241 states and 93183 transitions. [2019-09-08 10:21:49,470 INFO L78 Accepts]: Start accepts. Automaton has 71241 states and 93183 transitions. Word has length 80 [2019-09-08 10:21:49,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:21:49,471 INFO L475 AbstractCegarLoop]: Abstraction has 71241 states and 93183 transitions. [2019-09-08 10:21:49,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:21:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 71241 states and 93183 transitions. [2019-09-08 10:21:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 10:21:49,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:21:49,489 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:21:49,490 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:21:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:21:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 148119732, now seen corresponding path program 1 times [2019-09-08 10:21:49,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:21:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:21:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:21:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:21:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:21:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:21:49,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:21:49,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:21:49,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:21:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:21:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:21:49,573 INFO L87 Difference]: Start difference. First operand 71241 states and 93183 transitions. Second operand 3 states. [2019-09-08 10:22:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:21,888 INFO L93 Difference]: Finished difference Result 203873 states and 266065 transitions. [2019-09-08 10:22:21,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:22:21,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-08 10:22:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:22,099 INFO L225 Difference]: With dead ends: 203873 [2019-09-08 10:22:22,099 INFO L226 Difference]: Without dead ends: 133737 [2019-09-08 10:22:22,159 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:22:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133737 states. [2019-09-08 10:22:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133737 to 96437. [2019-09-08 10:22:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96437 states. [2019-09-08 10:22:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96437 states to 96437 states and 124039 transitions. [2019-09-08 10:22:44,776 INFO L78 Accepts]: Start accepts. Automaton has 96437 states and 124039 transitions. Word has length 92 [2019-09-08 10:22:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:44,777 INFO L475 AbstractCegarLoop]: Abstraction has 96437 states and 124039 transitions. [2019-09-08 10:22:44,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:22:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96437 states and 124039 transitions. [2019-09-08 10:22:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 10:22:44,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:44,788 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:44,789 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:44,789 INFO L82 PathProgramCache]: Analyzing trace with hash -424988470, now seen corresponding path program 1 times [2019-09-08 10:22:44,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:44,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:44,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:44,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:44,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:22:44,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:44,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:22:44,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:22:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:22:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:44,846 INFO L87 Difference]: Start difference. First operand 96437 states and 124039 transitions. Second operand 3 states. [2019-09-08 10:23:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:23:15,545 INFO L93 Difference]: Finished difference Result 217017 states and 278125 transitions. [2019-09-08 10:23:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:23:15,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 10:23:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:23:15,707 INFO L225 Difference]: With dead ends: 217017 [2019-09-08 10:23:15,707 INFO L226 Difference]: Without dead ends: 121685 [2019-09-08 10:23:15,773 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:23:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121685 states. [2019-09-08 10:23:43,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121685 to 109457. [2019-09-08 10:23:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109457 states. [2019-09-08 10:23:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109457 states to 109457 states and 138937 transitions. [2019-09-08 10:23:44,050 INFO L78 Accepts]: Start accepts. Automaton has 109457 states and 138937 transitions. Word has length 93 [2019-09-08 10:23:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:44,050 INFO L475 AbstractCegarLoop]: Abstraction has 109457 states and 138937 transitions. [2019-09-08 10:23:44,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109457 states and 138937 transitions. [2019-09-08 10:23:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:23:44,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:44,061 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:23:44,062 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash 551342129, now seen corresponding path program 1 times [2019-09-08 10:23:44,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:44,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:44,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:44,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:44,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:23:44,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:44,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:23:44,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:23:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:23:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:23:44,188 INFO L87 Difference]: Start difference. First operand 109457 states and 138937 transitions. Second operand 9 states. [2019-09-08 10:25:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:25:35,123 INFO L93 Difference]: Finished difference Result 479983 states and 607233 transitions. [2019-09-08 10:25:35,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:25:35,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 10:25:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:25:35,830 INFO L225 Difference]: With dead ends: 479983 [2019-09-08 10:25:35,831 INFO L226 Difference]: Without dead ends: 421649 [2019-09-08 10:25:35,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:25:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421649 states. [2019-09-08 10:26:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421649 to 109389. [2019-09-08 10:26:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109389 states. [2019-09-08 10:26:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109389 states to 109389 states and 138854 transitions. [2019-09-08 10:26:10,078 INFO L78 Accepts]: Start accepts. Automaton has 109389 states and 138854 transitions. Word has length 96 [2019-09-08 10:26:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:26:10,078 INFO L475 AbstractCegarLoop]: Abstraction has 109389 states and 138854 transitions. [2019-09-08 10:26:10,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:26:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 109389 states and 138854 transitions. [2019-09-08 10:26:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 10:26:10,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:26:10,089 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:26:10,090 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:26:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:26:10,090 INFO L82 PathProgramCache]: Analyzing trace with hash -777403506, now seen corresponding path program 1 times [2019-09-08 10:26:10,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:26:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:26:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:10,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:26:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:26:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:26:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 10:26:10,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:26:10,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:26:10,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:26:10,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:26:10,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:26:10,216 INFO L87 Difference]: Start difference. First operand 109389 states and 138854 transitions. Second operand 9 states. [2019-09-08 10:27:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:33,742 INFO L93 Difference]: Finished difference Result 389480 states and 495975 transitions. [2019-09-08 10:27:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:27:33,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-08 10:27:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:34,218 INFO L225 Difference]: With dead ends: 389480 [2019-09-08 10:27:34,218 INFO L226 Difference]: Without dead ends: 318505 [2019-09-08 10:27:34,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:27:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318505 states. [2019-09-08 10:28:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318505 to 109252. [2019-09-08 10:28:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109252 states. [2019-09-08 10:28:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109252 states to 109252 states and 138696 transitions. [2019-09-08 10:28:04,695 INFO L78 Accepts]: Start accepts. Automaton has 109252 states and 138696 transitions. Word has length 96 [2019-09-08 10:28:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:04,696 INFO L475 AbstractCegarLoop]: Abstraction has 109252 states and 138696 transitions. [2019-09-08 10:28:04,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:28:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 109252 states and 138696 transitions. [2019-09-08 10:28:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:28:04,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:04,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:28:04,708 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:04,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash -370268567, now seen corresponding path program 1 times [2019-09-08 10:28:04,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:04,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:04,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:04,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:28:04,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:04,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:28:04,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:28:04,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:28:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:28:04,897 INFO L87 Difference]: Start difference. First operand 109252 states and 138696 transitions. Second operand 10 states. [2019-09-08 10:29:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:29:47,439 INFO L93 Difference]: Finished difference Result 422554 states and 533105 transitions. [2019-09-08 10:29:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:29:47,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-09-08 10:29:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:29:48,014 INFO L225 Difference]: With dead ends: 422554 [2019-09-08 10:29:48,014 INFO L226 Difference]: Without dead ends: 358700 [2019-09-08 10:29:48,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 10:29:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358700 states. [2019-09-08 10:30:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358700 to 145048. [2019-09-08 10:30:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145048 states. [2019-09-08 10:30:33,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145048 states to 145048 states and 184060 transitions. [2019-09-08 10:30:33,245 INFO L78 Accepts]: Start accepts. Automaton has 145048 states and 184060 transitions. Word has length 97 [2019-09-08 10:30:33,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:30:33,245 INFO L475 AbstractCegarLoop]: Abstraction has 145048 states and 184060 transitions. [2019-09-08 10:30:33,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:30:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 145048 states and 184060 transitions. [2019-09-08 10:30:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:30:33,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:30:33,646 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:30:33,646 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:30:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:30:33,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1779273042, now seen corresponding path program 1 times [2019-09-08 10:30:33,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:30:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:30:33,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:33,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:30:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:30:33,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:30:33,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:30:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:30:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:30:34,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:30:34,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:30:34,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:30:34,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:30:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:30:35,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:30:35,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2019-09-08 10:30:35,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 10:30:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 10:30:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:30:35,062 INFO L87 Difference]: Start difference. First operand 145048 states and 184060 transitions. Second operand 18 states. [2019-09-08 10:30:35,445 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 10:30:35,577 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-08 10:30:35,941 WARN L188 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 10:30:37,377 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-09-08 10:30:40,169 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-09-08 10:30:41,155 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-09-08 10:30:42,243 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 10:30:42,512 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-09-08 10:30:43,225 WARN L188 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 10:30:43,992 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-08 10:30:46,588 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:30:53,505 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 10:30:58,000 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 10:31:05,669 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:31:08,885 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-09-08 10:31:12,103 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55