java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:47:53,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:47:53,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:47:53,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:47:53,479 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:47:53,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:47:53,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:47:53,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:47:53,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:47:53,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:47:53,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:47:53,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:47:53,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:47:53,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:47:53,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:47:53,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:47:53,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:47:53,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:47:53,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:47:53,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:47:53,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:47:53,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:47:53,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:47:53,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:47:53,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:47:53,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:47:53,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:47:53,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:47:53,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:47:53,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:47:53,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:47:53,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:47:53,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:47:53,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:47:53,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:47:53,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:47:53,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:47:53,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:47:53,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:47:53,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:47:53,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:47:53,514 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:47:53,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:47:53,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:47:53,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:47:53,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:47:53,531 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:47:53,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:47:53,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:47:53,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:47:53,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:47:53,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:47:53,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:47:53,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:47:53,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:47:53,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:47:53,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:47:53,533 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:47:53,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:47:53,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:47:53,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:47:53,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:47:53,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:47:53,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:47:53,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:47:53,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:47:53,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:47:53,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:47:53,536 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:47:53,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:47:53,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:47:53,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:47:53,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:47:53,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:47:53,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:47:53,585 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:47:53,585 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:47:53,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad51a290/de9a5700c33e4f3b942a5205cf0eb3b6/FLAGaf6ed6cda [2019-09-08 10:47:54,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:47:54,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:47:54,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad51a290/de9a5700c33e4f3b942a5205cf0eb3b6/FLAGaf6ed6cda [2019-09-08 10:47:54,996 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dad51a290/de9a5700c33e4f3b942a5205cf0eb3b6 [2019-09-08 10:47:55,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:47:55,013 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:47:55,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:55,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:47:55,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:47:55,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:54" (1/1) ... [2019-09-08 10:47:55,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aac0b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:55, skipping insertion in model container [2019-09-08 10:47:55,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:47:54" (1/1) ... [2019-09-08 10:47:55,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:47:55,272 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:47:56,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:56,693 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:47:57,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:47:57,419 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:47:57,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57 WrapperNode [2019-09-08 10:47:57,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:47:57,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:47:57,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:47:57,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:47:57,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (1/1) ... [2019-09-08 10:47:57,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:47:57,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:47:57,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:47:57,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:47:57,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (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:47:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:47:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:47:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:47:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:47:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:47:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:47:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:47:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:47:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:47:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:47:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:47:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:47:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:47:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:47:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:47:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:47:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:47:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:47:57,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:48:02,778 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:48:02,778 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:48:02,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:48:02 BoogieIcfgContainer [2019-09-08 10:48:02,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:48:02,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:48:02,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:48:02,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:48:02,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:47:54" (1/3) ... [2019-09-08 10:48:02,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7515737c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:48:02, skipping insertion in model container [2019-09-08 10:48:02,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:47:57" (2/3) ... [2019-09-08 10:48:02,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7515737c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:48:02, skipping insertion in model container [2019-09-08 10:48:02,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:48:02" (3/3) ... [2019-09-08 10:48:02,789 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:48:02,800 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:48:02,812 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-09-08 10:48:02,829 INFO L252 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-09-08 10:48:02,890 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:48:02,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:48:02,892 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:48:02,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:48:02,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:48:02,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:48:02,892 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:48:02,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:48:02,892 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:48:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states. [2019-09-08 10:48:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:48:02,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:02,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:02,987 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1426052776, now seen corresponding path program 1 times [2019-09-08 10:48:02,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:02,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:03,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:03,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:03,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:03,655 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:48:03,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:48:03,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:48:03,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:48:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:48:03,680 INFO L87 Difference]: Start difference. First operand 2051 states. Second operand 5 states. [2019-09-08 10:48:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:07,346 INFO L93 Difference]: Finished difference Result 4034 states and 7037 transitions. [2019-09-08 10:48:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:07,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 10:48:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:07,391 INFO L225 Difference]: With dead ends: 4034 [2019-09-08 10:48:07,391 INFO L226 Difference]: Without dead ends: 2686 [2019-09-08 10:48:07,404 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:48:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-09-08 10:48:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2680. [2019-09-08 10:48:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2680 states. [2019-09-08 10:48:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2680 states to 2680 states and 3477 transitions. [2019-09-08 10:48:07,628 INFO L78 Accepts]: Start accepts. Automaton has 2680 states and 3477 transitions. Word has length 69 [2019-09-08 10:48:07,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:07,630 INFO L475 AbstractCegarLoop]: Abstraction has 2680 states and 3477 transitions. [2019-09-08 10:48:07,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:48:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3477 transitions. [2019-09-08 10:48:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:48:07,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:07,644 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:48:07,645 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:07,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2077560721, now seen corresponding path program 1 times [2019-09-08 10:48:07,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:07,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:07,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:07,919 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:48:07,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:07,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:07,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:07,923 INFO L87 Difference]: Start difference. First operand 2680 states and 3477 transitions. Second operand 6 states. [2019-09-08 10:48:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:09,965 INFO L93 Difference]: Finished difference Result 4915 states and 6420 transitions. [2019-09-08 10:48:09,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:09,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:48:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:09,982 INFO L225 Difference]: With dead ends: 4915 [2019-09-08 10:48:09,983 INFO L226 Difference]: Without dead ends: 3335 [2019-09-08 10:48:09,987 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:48:09,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2019-09-08 10:48:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3316. [2019-09-08 10:48:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2019-09-08 10:48:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4359 transitions. [2019-09-08 10:48:10,106 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4359 transitions. Word has length 70 [2019-09-08 10:48:10,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:10,107 INFO L475 AbstractCegarLoop]: Abstraction has 3316 states and 4359 transitions. [2019-09-08 10:48:10,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:10,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4359 transitions. [2019-09-08 10:48:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:48:10,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:10,114 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:48:10,114 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1727713842, now seen corresponding path program 1 times [2019-09-08 10:48:10,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:10,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:10,398 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:48:10,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:10,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:10,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:10,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:10,400 INFO L87 Difference]: Start difference. First operand 3316 states and 4359 transitions. Second operand 6 states. [2019-09-08 10:48:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:12,500 INFO L93 Difference]: Finished difference Result 8093 states and 10667 transitions. [2019-09-08 10:48:12,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:12,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:48:12,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:12,527 INFO L225 Difference]: With dead ends: 8093 [2019-09-08 10:48:12,527 INFO L226 Difference]: Without dead ends: 5659 [2019-09-08 10:48:12,534 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:48:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2019-09-08 10:48:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5632. [2019-09-08 10:48:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5632 states. [2019-09-08 10:48:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 7330 transitions. [2019-09-08 10:48:12,733 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 7330 transitions. Word has length 70 [2019-09-08 10:48:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:12,735 INFO L475 AbstractCegarLoop]: Abstraction has 5632 states and 7330 transitions. [2019-09-08 10:48:12,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 7330 transitions. [2019-09-08 10:48:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:48:12,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:12,756 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:48:12,758 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:12,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1423274902, now seen corresponding path program 1 times [2019-09-08 10:48:12,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:12,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:12,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:13,249 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:48:13,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:13,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:48:13,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:48:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:48:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:48:13,253 INFO L87 Difference]: Start difference. First operand 5632 states and 7330 transitions. Second operand 10 states. [2019-09-08 10:48:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:20,541 INFO L93 Difference]: Finished difference Result 18600 states and 26858 transitions. [2019-09-08 10:48:20,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 10:48:20,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2019-09-08 10:48:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:20,682 INFO L225 Difference]: With dead ends: 18600 [2019-09-08 10:48:20,682 INFO L226 Difference]: Without dead ends: 16984 [2019-09-08 10:48:20,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 10:48:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16984 states. [2019-09-08 10:48:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16984 to 5639. [2019-09-08 10:48:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2019-09-08 10:48:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7337 transitions. [2019-09-08 10:48:21,214 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7337 transitions. Word has length 71 [2019-09-08 10:48:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:21,215 INFO L475 AbstractCegarLoop]: Abstraction has 5639 states and 7337 transitions. [2019-09-08 10:48:21,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:48:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7337 transitions. [2019-09-08 10:48:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:48:21,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:21,223 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:48:21,224 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash -717705231, now seen corresponding path program 1 times [2019-09-08 10:48:21,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:21,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:21,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:21,526 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:48:21,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:21,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:48:21,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:48:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:48:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:48:21,529 INFO L87 Difference]: Start difference. First operand 5639 states and 7337 transitions. Second operand 9 states. [2019-09-08 10:48:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:25,972 INFO L93 Difference]: Finished difference Result 8412 states and 11532 transitions. [2019-09-08 10:48:25,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:48:25,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:48:25,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:25,995 INFO L225 Difference]: With dead ends: 8412 [2019-09-08 10:48:25,995 INFO L226 Difference]: Without dead ends: 8406 [2019-09-08 10:48:26,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:48:26,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8406 states. [2019-09-08 10:48:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8406 to 5639. [2019-09-08 10:48:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5639 states. [2019-09-08 10:48:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5639 states to 5639 states and 7336 transitions. [2019-09-08 10:48:26,302 INFO L78 Accepts]: Start accepts. Automaton has 5639 states and 7336 transitions. Word has length 72 [2019-09-08 10:48:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:26,303 INFO L475 AbstractCegarLoop]: Abstraction has 5639 states and 7336 transitions. [2019-09-08 10:48:26,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:48:26,303 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7336 transitions. [2019-09-08 10:48:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:48:26,311 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:26,311 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:48:26,311 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:26,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1312277498, now seen corresponding path program 1 times [2019-09-08 10:48:26,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:26,498 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:48:26,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:26,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:48:26,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:48:26,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:48:26,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:48:26,500 INFO L87 Difference]: Start difference. First operand 5639 states and 7336 transitions. Second operand 6 states. [2019-09-08 10:48:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:28,687 INFO L93 Difference]: Finished difference Result 13971 states and 18590 transitions. [2019-09-08 10:48:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:48:28,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-08 10:48:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:28,711 INFO L225 Difference]: With dead ends: 13971 [2019-09-08 10:48:28,711 INFO L226 Difference]: Without dead ends: 10371 [2019-09-08 10:48:28,722 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:48:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10371 states. [2019-09-08 10:48:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10371 to 10359. [2019-09-08 10:48:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-09-08 10:48:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 13715 transitions. [2019-09-08 10:48:30,032 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 13715 transitions. Word has length 72 [2019-09-08 10:48:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:30,034 INFO L475 AbstractCegarLoop]: Abstraction has 10359 states and 13715 transitions. [2019-09-08 10:48:30,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:48:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 13715 transitions. [2019-09-08 10:48:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:48:30,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:30,048 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:48:30,048 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:30,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -426903766, now seen corresponding path program 1 times [2019-09-08 10:48:30,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:30,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:30,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:30,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:30,657 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:48:30,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:48:30,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:48:30,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:48:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:48:30,660 INFO L87 Difference]: Start difference. First operand 10359 states and 13715 transitions. Second operand 12 states. [2019-09-08 10:48:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:37,295 INFO L93 Difference]: Finished difference Result 56603 states and 83183 transitions. [2019-09-08 10:48:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:48:37,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-08 10:48:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:37,412 INFO L225 Difference]: With dead ends: 56603 [2019-09-08 10:48:37,413 INFO L226 Difference]: Without dead ends: 52473 [2019-09-08 10:48:37,434 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:48:37,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52473 states. [2019-09-08 10:48:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52473 to 10227. [2019-09-08 10:48:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10227 states. [2019-09-08 10:48:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10227 states to 10227 states and 13529 transitions. [2019-09-08 10:48:38,476 INFO L78 Accepts]: Start accepts. Automaton has 10227 states and 13529 transitions. Word has length 72 [2019-09-08 10:48:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:38,476 INFO L475 AbstractCegarLoop]: Abstraction has 10227 states and 13529 transitions. [2019-09-08 10:48:38,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:48:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10227 states and 13529 transitions. [2019-09-08 10:48:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:38,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:38,486 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:48:38,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:38,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:38,487 INFO L82 PathProgramCache]: Analyzing trace with hash 808228230, now seen corresponding path program 1 times [2019-09-08 10:48:38,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:38,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:38,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:38,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:38,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:38,740 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:48:38,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:38,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:48:38,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:48:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:48:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:48:38,742 INFO L87 Difference]: Start difference. First operand 10227 states and 13529 transitions. Second operand 10 states. [2019-09-08 10:48:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:47,286 INFO L93 Difference]: Finished difference Result 36524 states and 52271 transitions. [2019-09-08 10:48:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:48:47,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-09-08 10:48:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:47,328 INFO L225 Difference]: With dead ends: 36524 [2019-09-08 10:48:47,328 INFO L226 Difference]: Without dead ends: 32494 [2019-09-08 10:48:47,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2019-09-08 10:48:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32494 states. [2019-09-08 10:48:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32494 to 10199. [2019-09-08 10:48:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10199 states. [2019-09-08 10:48:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 13496 transitions. [2019-09-08 10:48:48,405 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 13496 transitions. Word has length 73 [2019-09-08 10:48:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:48,406 INFO L475 AbstractCegarLoop]: Abstraction has 10199 states and 13496 transitions. [2019-09-08 10:48:48,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:48:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 13496 transitions. [2019-09-08 10:48:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:48:48,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:48,414 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:48:48,414 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:48,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1947735451, now seen corresponding path program 1 times [2019-09-08 10:48:48,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:48,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:48,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:48,896 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:48:48,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:48,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:48:48,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:48:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:48:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:48:48,897 INFO L87 Difference]: Start difference. First operand 10199 states and 13496 transitions. Second operand 12 states. [2019-09-08 10:48:52,245 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-09-08 10:48:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:48:58,235 INFO L93 Difference]: Finished difference Result 52358 states and 76834 transitions. [2019-09-08 10:48:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:48:58,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 10:48:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:48:58,308 INFO L225 Difference]: With dead ends: 52358 [2019-09-08 10:48:58,308 INFO L226 Difference]: Without dead ends: 52349 [2019-09-08 10:48:58,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:48:58,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52349 states. [2019-09-08 10:48:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52349 to 10190. [2019-09-08 10:48:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10190 states. [2019-09-08 10:48:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10190 states to 10190 states and 13487 transitions. [2019-09-08 10:48:59,510 INFO L78 Accepts]: Start accepts. Automaton has 10190 states and 13487 transitions. Word has length 73 [2019-09-08 10:48:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:59,510 INFO L475 AbstractCegarLoop]: Abstraction has 10190 states and 13487 transitions. [2019-09-08 10:48:59,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:48:59,510 INFO L276 IsEmpty]: Start isEmpty. Operand 10190 states and 13487 transitions. [2019-09-08 10:48:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:48:59,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:59,518 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:48:59,518 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:59,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:59,518 INFO L82 PathProgramCache]: Analyzing trace with hash -203314022, now seen corresponding path program 1 times [2019-09-08 10:48:59,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:59,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:59,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:59,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:00,093 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:49:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:49:00,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:49:00,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:49:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:49:00,094 INFO L87 Difference]: Start difference. First operand 10190 states and 13487 transitions. Second operand 12 states. [2019-09-08 10:49:00,856 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 10:49:01,109 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-09-08 10:49:01,364 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 10:49:01,670 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 10:49:01,922 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 10:49:02,505 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-09-08 10:49:02,991 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-08 10:49:05,096 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-08 10:49:05,638 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-09-08 10:49:06,093 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 10:49:06,646 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-08 10:49:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:13,136 INFO L93 Difference]: Finished difference Result 54282 states and 79782 transitions. [2019-09-08 10:49:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:49:13,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:49:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:13,191 INFO L225 Difference]: With dead ends: 54282 [2019-09-08 10:49:13,191 INFO L226 Difference]: Without dead ends: 50249 [2019-09-08 10:49:13,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:49:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50249 states. [2019-09-08 10:49:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50249 to 10200. [2019-09-08 10:49:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10200 states. [2019-09-08 10:49:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 13500 transitions. [2019-09-08 10:49:14,702 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 13500 transitions. Word has length 74 [2019-09-08 10:49:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:14,702 INFO L475 AbstractCegarLoop]: Abstraction has 10200 states and 13500 transitions. [2019-09-08 10:49:14,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:49:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 13500 transitions. [2019-09-08 10:49:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:49:14,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:14,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:14,709 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:14,709 INFO L82 PathProgramCache]: Analyzing trace with hash 921468835, now seen corresponding path program 1 times [2019-09-08 10:49:14,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:14,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:14,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:14,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:14,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:14,801 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:49:14,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:14,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:14,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:14,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:14,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:14,803 INFO L87 Difference]: Start difference. First operand 10200 states and 13500 transitions. Second operand 3 states. [2019-09-08 10:49:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:16,950 INFO L93 Difference]: Finished difference Result 21202 states and 28816 transitions. [2019-09-08 10:49:16,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:16,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:49:16,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:16,961 INFO L225 Difference]: With dead ends: 21202 [2019-09-08 10:49:16,961 INFO L226 Difference]: Without dead ends: 12555 [2019-09-08 10:49:16,974 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:49:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12555 states. [2019-09-08 10:49:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12555 to 12544. [2019-09-08 10:49:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12544 states. [2019-09-08 10:49:18,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12544 states to 12544 states and 17078 transitions. [2019-09-08 10:49:18,800 INFO L78 Accepts]: Start accepts. Automaton has 12544 states and 17078 transitions. Word has length 75 [2019-09-08 10:49:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:18,801 INFO L475 AbstractCegarLoop]: Abstraction has 12544 states and 17078 transitions. [2019-09-08 10:49:18,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:18,801 INFO L276 IsEmpty]: Start isEmpty. Operand 12544 states and 17078 transitions. [2019-09-08 10:49:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:49:18,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:18,807 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:18,807 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash -586638805, now seen corresponding path program 1 times [2019-09-08 10:49:18,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:18,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:18,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:18,894 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:49:18,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:18,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:49:18,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:49:18,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:49:18,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:49:18,896 INFO L87 Difference]: Start difference. First operand 12544 states and 17078 transitions. Second operand 3 states. [2019-09-08 10:49:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:22,101 INFO L93 Difference]: Finished difference Result 23991 states and 34106 transitions. [2019-09-08 10:49:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:49:22,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:49:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:22,123 INFO L225 Difference]: With dead ends: 23991 [2019-09-08 10:49:22,123 INFO L226 Difference]: Without dead ends: 14944 [2019-09-08 10:49:22,136 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:49:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2019-09-08 10:49:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 14931. [2019-09-08 10:49:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-08 10:49:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21161 transitions. [2019-09-08 10:49:24,755 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21161 transitions. Word has length 75 [2019-09-08 10:49:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:24,756 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21161 transitions. [2019-09-08 10:49:24,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:49:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21161 transitions. [2019-09-08 10:49:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:49:24,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:24,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:24,761 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash -892848695, now seen corresponding path program 1 times [2019-09-08 10:49:24,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:24,945 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:49:24,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:24,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:49:24,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:49:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:49:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:49:24,947 INFO L87 Difference]: Start difference. First operand 14931 states and 21161 transitions. Second operand 9 states. [2019-09-08 10:49:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:36,080 INFO L93 Difference]: Finished difference Result 39947 states and 58301 transitions. [2019-09-08 10:49:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:49:36,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:49:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:36,121 INFO L225 Difference]: With dead ends: 39947 [2019-09-08 10:49:36,121 INFO L226 Difference]: Without dead ends: 39938 [2019-09-08 10:49:36,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:49:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states. [2019-09-08 10:49:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 14931. [2019-09-08 10:49:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-08 10:49:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21160 transitions. [2019-09-08 10:49:38,911 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21160 transitions. Word has length 75 [2019-09-08 10:49:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:38,912 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21160 transitions. [2019-09-08 10:49:38,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:49:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21160 transitions. [2019-09-08 10:49:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:49:38,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:38,917 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:38,917 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:38,918 INFO L82 PathProgramCache]: Analyzing trace with hash 352856601, now seen corresponding path program 1 times [2019-09-08 10:49:38,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:38,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:38,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:38,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:38,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:39,168 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:49:39,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:39,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:49:39,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:49:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:49:39,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:49:39,170 INFO L87 Difference]: Start difference. First operand 14931 states and 21160 transitions. Second operand 10 states. [2019-09-08 10:49:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:56,751 INFO L93 Difference]: Finished difference Result 71771 states and 106279 transitions. [2019-09-08 10:49:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:49:56,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-09-08 10:49:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:56,819 INFO L225 Difference]: With dead ends: 71771 [2019-09-08 10:49:56,819 INFO L226 Difference]: Without dead ends: 60271 [2019-09-08 10:49:56,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:49:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60271 states. [2019-09-08 10:49:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60271 to 14931. [2019-09-08 10:49:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14931 states. [2019-09-08 10:49:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14931 states to 14931 states and 21159 transitions. [2019-09-08 10:49:59,923 INFO L78 Accepts]: Start accepts. Automaton has 14931 states and 21159 transitions. Word has length 76 [2019-09-08 10:49:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:59,923 INFO L475 AbstractCegarLoop]: Abstraction has 14931 states and 21159 transitions. [2019-09-08 10:49:59,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:49:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand 14931 states and 21159 transitions. [2019-09-08 10:49:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:49:59,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:59,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:59,929 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -260698378, now seen corresponding path program 1 times [2019-09-08 10:49:59,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:00,377 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:50:00,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:00,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:50:00,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:50:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:50:00,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:50:00,379 INFO L87 Difference]: Start difference. First operand 14931 states and 21159 transitions. Second operand 12 states. [2019-09-08 10:50:00,932 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-08 10:50:01,084 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 10:50:01,230 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 10:50:01,402 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 10:50:01,605 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 10:50:04,115 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 10:50:05,069 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 10:50:10,879 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-08 10:50:12,083 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-09-08 10:50:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:24,243 INFO L93 Difference]: Finished difference Result 92473 states and 137401 transitions. [2019-09-08 10:50:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:50:24,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 76 [2019-09-08 10:50:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:24,336 INFO L225 Difference]: With dead ends: 92473 [2019-09-08 10:50:24,336 INFO L226 Difference]: Without dead ends: 81546 [2019-09-08 10:50:24,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:50:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81546 states. [2019-09-08 10:50:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81546 to 14846. [2019-09-08 10:50:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14846 states. [2019-09-08 10:50:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14846 states to 14846 states and 21067 transitions. [2019-09-08 10:50:27,997 INFO L78 Accepts]: Start accepts. Automaton has 14846 states and 21067 transitions. Word has length 76 [2019-09-08 10:50:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:27,997 INFO L475 AbstractCegarLoop]: Abstraction has 14846 states and 21067 transitions. [2019-09-08 10:50:27,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:50:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 14846 states and 21067 transitions. [2019-09-08 10:50:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:50:28,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:28,003 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] [2019-09-08 10:50:28,003 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:28,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1896278784, now seen corresponding path program 1 times [2019-09-08 10:50:28,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:28,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:28,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:28,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:28,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:28,100 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:50:28,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:28,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:50:28,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:50:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:50:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:50:28,102 INFO L87 Difference]: Start difference. First operand 14846 states and 21067 transitions. Second operand 3 states. [2019-09-08 10:50:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:34,968 INFO L93 Difference]: Finished difference Result 35769 states and 52330 transitions. [2019-09-08 10:50:34,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:50:34,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:50:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:34,995 INFO L225 Difference]: With dead ends: 35769 [2019-09-08 10:50:34,995 INFO L226 Difference]: Without dead ends: 23779 [2019-09-08 10:50:35,009 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:50:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23779 states. [2019-09-08 10:50:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23779 to 23777. [2019-09-08 10:50:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-08 10:50:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34272 transitions. [2019-09-08 10:50:41,024 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34272 transitions. Word has length 77 [2019-09-08 10:50:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:50:41,025 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34272 transitions. [2019-09-08 10:50:41,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:50:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34272 transitions. [2019-09-08 10:50:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:50:41,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:50:41,029 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] [2019-09-08 10:50:41,029 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:50:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:50:41,030 INFO L82 PathProgramCache]: Analyzing trace with hash -722727837, now seen corresponding path program 1 times [2019-09-08 10:50:41,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:50:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:50:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:41,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:50:41,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:50:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:50:41,297 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:50:41,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:50:41,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:50:41,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:50:41,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:50:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:50:41,300 INFO L87 Difference]: Start difference. First operand 23777 states and 34272 transitions. Second operand 10 states. [2019-09-08 10:51:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:01,432 INFO L93 Difference]: Finished difference Result 63561 states and 91960 transitions. [2019-09-08 10:51:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:51:01,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-09-08 10:51:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:01,503 INFO L225 Difference]: With dead ends: 63561 [2019-09-08 10:51:01,503 INFO L226 Difference]: Without dead ends: 58040 [2019-09-08 10:51:01,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:51:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58040 states. [2019-09-08 10:51:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58040 to 23777. [2019-09-08 10:51:07,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-08 10:51:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34271 transitions. [2019-09-08 10:51:07,977 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34271 transitions. Word has length 77 [2019-09-08 10:51:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:07,978 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34271 transitions. [2019-09-08 10:51:07,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:51:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34271 transitions. [2019-09-08 10:51:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:51:07,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:07,981 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] [2019-09-08 10:51:07,982 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:07,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1364267603, now seen corresponding path program 1 times [2019-09-08 10:51:07,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:07,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:07,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:07,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:07,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:51:08,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:08,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:51:08,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:51:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:51:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:08,146 INFO L87 Difference]: Start difference. First operand 23777 states and 34271 transitions. Second operand 9 states. [2019-09-08 10:51:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:32,674 INFO L93 Difference]: Finished difference Result 74406 states and 108393 transitions. [2019-09-08 10:51:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 10:51:32,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 10:51:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:32,751 INFO L225 Difference]: With dead ends: 74406 [2019-09-08 10:51:32,752 INFO L226 Difference]: Without dead ends: 68957 [2019-09-08 10:51:32,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:51:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68957 states. [2019-09-08 10:51:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68957 to 23777. [2019-09-08 10:51:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23777 states. [2019-09-08 10:51:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23777 states to 23777 states and 34270 transitions. [2019-09-08 10:51:39,284 INFO L78 Accepts]: Start accepts. Automaton has 23777 states and 34270 transitions. Word has length 77 [2019-09-08 10:51:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:39,285 INFO L475 AbstractCegarLoop]: Abstraction has 23777 states and 34270 transitions. [2019-09-08 10:51:39,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:51:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 23777 states and 34270 transitions. [2019-09-08 10:51:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:51:39,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:39,289 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] [2019-09-08 10:51:39,290 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 330353004, now seen corresponding path program 1 times [2019-09-08 10:51:39,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:39,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:39,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:39,381 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:51:39,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:39,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:51:39,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:51:39,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:51:39,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:51:39,382 INFO L87 Difference]: Start difference. First operand 23777 states and 34270 transitions. Second operand 3 states. [2019-09-08 10:51:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:51:51,591 INFO L93 Difference]: Finished difference Result 62943 states and 92283 transitions. [2019-09-08 10:51:51,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:51:51,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:51:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:51:51,637 INFO L225 Difference]: With dead ends: 62943 [2019-09-08 10:51:51,637 INFO L226 Difference]: Without dead ends: 41671 [2019-09-08 10:51:51,657 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:51:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41671 states. [2019-09-08 10:52:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41671 to 29465. [2019-09-08 10:52:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29465 states. [2019-09-08 10:52:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29465 states to 29465 states and 42436 transitions. [2019-09-08 10:52:01,796 INFO L78 Accepts]: Start accepts. Automaton has 29465 states and 42436 transitions. Word has length 78 [2019-09-08 10:52:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:01,796 INFO L475 AbstractCegarLoop]: Abstraction has 29465 states and 42436 transitions. [2019-09-08 10:52:01,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 29465 states and 42436 transitions. [2019-09-08 10:52:01,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:52:01,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:01,859 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] [2019-09-08 10:52:01,860 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:01,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1275820425, now seen corresponding path program 1 times [2019-09-08 10:52:01,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:01,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:01,950 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:52:01,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:01,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:01,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:01,953 INFO L87 Difference]: Start difference. First operand 29465 states and 42436 transitions. Second operand 3 states. [2019-09-08 10:52:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:19,515 INFO L93 Difference]: Finished difference Result 80863 states and 117232 transitions. [2019-09-08 10:52:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:52:19,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:52:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:19,588 INFO L225 Difference]: With dead ends: 80863 [2019-09-08 10:52:19,589 INFO L226 Difference]: Without dead ends: 53487 [2019-09-08 10:52:19,622 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:52:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53487 states. [2019-09-08 10:52:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53487 to 44873. [2019-09-08 10:52:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44873 states. [2019-09-08 10:52:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44873 states to 44873 states and 63899 transitions. [2019-09-08 10:52:35,181 INFO L78 Accepts]: Start accepts. Automaton has 44873 states and 63899 transitions. Word has length 78 [2019-09-08 10:52:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:35,182 INFO L475 AbstractCegarLoop]: Abstraction has 44873 states and 63899 transitions. [2019-09-08 10:52:35,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:52:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44873 states and 63899 transitions. [2019-09-08 10:52:35,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:52:35,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:35,186 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:52:35,187 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:35,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1108611303, now seen corresponding path program 1 times [2019-09-08 10:52:35,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:35,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:35,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:35,254 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:52:35,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:35,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:52:35,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:52:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:52:35,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:52:35,256 INFO L87 Difference]: Start difference. First operand 44873 states and 63899 transitions. Second operand 3 states. [2019-09-08 10:53:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:53:04,691 INFO L93 Difference]: Finished difference Result 120345 states and 172845 transitions. [2019-09-08 10:53:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:53:04,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 10:53:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:53:04,784 INFO L225 Difference]: With dead ends: 120345 [2019-09-08 10:53:04,784 INFO L226 Difference]: Without dead ends: 76485 [2019-09-08 10:53:04,828 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:53:04,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76485 states. [2019-09-08 10:53:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76485 to 59119. [2019-09-08 10:53:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59119 states. [2019-09-08 10:53:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59119 states to 59119 states and 84762 transitions. [2019-09-08 10:53:26,117 INFO L78 Accepts]: Start accepts. Automaton has 59119 states and 84762 transitions. Word has length 79 [2019-09-08 10:53:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:53:26,118 INFO L475 AbstractCegarLoop]: Abstraction has 59119 states and 84762 transitions. [2019-09-08 10:53:26,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:53:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 59119 states and 84762 transitions. [2019-09-08 10:53:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:53:26,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:53:26,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:53:26,121 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:53:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:53:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash -857135845, now seen corresponding path program 1 times [2019-09-08 10:53:26,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:53:26,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:53:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:26,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:53:26,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:53:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:53:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:53:26,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:53:26,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:53:26,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:53:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:53:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:53:26,324 INFO L87 Difference]: Start difference. First operand 59119 states and 84762 transitions. Second operand 10 states. [2019-09-08 10:54:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:54:18,866 INFO L93 Difference]: Finished difference Result 125693 states and 178921 transitions. [2019-09-08 10:54:18,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:54:18,868 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2019-09-08 10:54:18,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:54:19,023 INFO L225 Difference]: With dead ends: 125693 [2019-09-08 10:54:19,024 INFO L226 Difference]: Without dead ends: 124222 [2019-09-08 10:54:19,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2019-09-08 10:54:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124222 states. [2019-09-08 10:54:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124222 to 59119. [2019-09-08 10:54:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59119 states. [2019-09-08 10:54:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59119 states to 59119 states and 84761 transitions. [2019-09-08 10:54:41,012 INFO L78 Accepts]: Start accepts. Automaton has 59119 states and 84761 transitions. Word has length 79 [2019-09-08 10:54:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:54:41,012 INFO L475 AbstractCegarLoop]: Abstraction has 59119 states and 84761 transitions. [2019-09-08 10:54:41,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:54:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 59119 states and 84761 transitions. [2019-09-08 10:54:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 10:54:41,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:54:41,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:54:41,015 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:54:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:54:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash 882523075, now seen corresponding path program 1 times [2019-09-08 10:54:41,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:54:41,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:54:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:54:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:54:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:54:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:54:41,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:54:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:54:41,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:54:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:54:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:54:41,183 INFO L87 Difference]: Start difference. First operand 59119 states and 84761 transitions. Second operand 9 states. [2019-09-08 10:55:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:55:28,488 INFO L93 Difference]: Finished difference Result 105838 states and 151528 transitions. [2019-09-08 10:55:28,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:55:28,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-09-08 10:55:28,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:55:28,611 INFO L225 Difference]: With dead ends: 105838 [2019-09-08 10:55:28,611 INFO L226 Difference]: Without dead ends: 104495 [2019-09-08 10:55:28,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:55:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-08 10:55:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-08 10:55:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 10:55:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84752 transitions. [2019-09-08 10:55:50,776 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84752 transitions. Word has length 79 [2019-09-08 10:55:50,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:55:50,776 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84752 transitions. [2019-09-08 10:55:50,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:55:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84752 transitions. [2019-09-08 10:55:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:55:50,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:55:50,779 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:55:50,779 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:55:50,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:55:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1930536495, now seen corresponding path program 1 times [2019-09-08 10:55:50,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:55:50,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:55:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:50,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:55:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:55:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:55:50,983 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:55:50,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:55:50,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:55:50,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:55:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:55:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:55:50,984 INFO L87 Difference]: Start difference. First operand 59114 states and 84752 transitions. Second operand 9 states. [2019-09-08 10:56:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:56:37,070 INFO L93 Difference]: Finished difference Result 105866 states and 151557 transitions. [2019-09-08 10:56:37,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:56:37,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:56:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:56:37,199 INFO L225 Difference]: With dead ends: 105866 [2019-09-08 10:56:37,199 INFO L226 Difference]: Without dead ends: 104503 [2019-09-08 10:56:37,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:56:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104503 states. [2019-09-08 10:56:59,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104503 to 59114. [2019-09-08 10:56:59,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 10:56:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84751 transitions. [2019-09-08 10:56:59,203 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84751 transitions. Word has length 80 [2019-09-08 10:56:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:56:59,203 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84751 transitions. [2019-09-08 10:56:59,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:56:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84751 transitions. [2019-09-08 10:56:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:56:59,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:56:59,206 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:56:59,207 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:56:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:56:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1355470910, now seen corresponding path program 1 times [2019-09-08 10:56:59,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:56:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:56:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:56:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:56:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:56:59,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:56:59,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:56:59,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:56:59,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:56:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:56:59,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:56:59,380 INFO L87 Difference]: Start difference. First operand 59114 states and 84751 transitions. Second operand 9 states. [2019-09-08 10:57:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:57:44,593 INFO L93 Difference]: Finished difference Result 105836 states and 151521 transitions. [2019-09-08 10:57:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:57:44,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:57:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:57:44,717 INFO L225 Difference]: With dead ends: 105836 [2019-09-08 10:57:44,717 INFO L226 Difference]: Without dead ends: 104495 [2019-09-08 10:57:44,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:57:44,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-08 10:58:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-08 10:58:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 10:58:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84750 transitions. [2019-09-08 10:58:08,457 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84750 transitions. Word has length 80 [2019-09-08 10:58:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:58:08,457 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84750 transitions. [2019-09-08 10:58:08,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:58:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84750 transitions. [2019-09-08 10:58:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:58:08,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:58:08,460 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:58:08,460 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:58:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:58:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash -520682382, now seen corresponding path program 1 times [2019-09-08 10:58:08,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:58:08,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:58:08,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:08,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:58:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:58:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:58:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:58:08,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:58:08,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:58:08,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:58:08,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:58:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:58:08,634 INFO L87 Difference]: Start difference. First operand 59114 states and 84750 transitions. Second operand 9 states. [2019-09-08 10:58:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:58:53,285 INFO L93 Difference]: Finished difference Result 105891 states and 151584 transitions. [2019-09-08 10:58:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:58:53,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 10:58:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:58:53,411 INFO L225 Difference]: With dead ends: 105891 [2019-09-08 10:58:53,411 INFO L226 Difference]: Without dead ends: 104503 [2019-09-08 10:58:53,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:58:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104503 states. [2019-09-08 10:59:15,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104503 to 59114. [2019-09-08 10:59:15,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 10:59:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84748 transitions. [2019-09-08 10:59:15,396 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84748 transitions. Word has length 80 [2019-09-08 10:59:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:15,396 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84748 transitions. [2019-09-08 10:59:15,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:59:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84748 transitions. [2019-09-08 10:59:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 10:59:15,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:15,399 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:59:15,399 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1815888049, now seen corresponding path program 1 times [2019-09-08 10:59:15,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:15,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:15,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:15,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:15,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:15,590 INFO L87 Difference]: Start difference. First operand 59114 states and 84748 transitions. Second operand 9 states. [2019-09-08 11:00:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:02,722 INFO L93 Difference]: Finished difference Result 105839 states and 151521 transitions. [2019-09-08 11:00:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:00:02,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 11:00:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:02,846 INFO L225 Difference]: With dead ends: 105839 [2019-09-08 11:00:02,846 INFO L226 Difference]: Without dead ends: 104495 [2019-09-08 11:00:02,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:00:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-08 11:00:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-08 11:00:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 11:00:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84746 transitions. [2019-09-08 11:00:25,197 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84746 transitions. Word has length 80 [2019-09-08 11:00:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:25,197 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84746 transitions. [2019-09-08 11:00:25,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:00:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84746 transitions. [2019-09-08 11:00:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:00:25,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:25,200 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 11:00:25,200 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 731986161, now seen corresponding path program 1 times [2019-09-08 11:00:25,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:25,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:25,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:25,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:25,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:00:25,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:00:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:00:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:00:25,372 INFO L87 Difference]: Start difference. First operand 59114 states and 84746 transitions. Second operand 9 states. [2019-09-08 11:01:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:11,923 INFO L93 Difference]: Finished difference Result 105843 states and 151524 transitions. [2019-09-08 11:01:11,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:01:11,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-08 11:01:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:12,058 INFO L225 Difference]: With dead ends: 105843 [2019-09-08 11:01:12,058 INFO L226 Difference]: Without dead ends: 104495 [2019-09-08 11:01:12,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:01:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104495 states. [2019-09-08 11:01:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104495 to 59114. [2019-09-08 11:01:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59114 states. [2019-09-08 11:01:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59114 states to 59114 states and 84744 transitions. [2019-09-08 11:01:36,265 INFO L78 Accepts]: Start accepts. Automaton has 59114 states and 84744 transitions. Word has length 80 [2019-09-08 11:01:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:36,265 INFO L475 AbstractCegarLoop]: Abstraction has 59114 states and 84744 transitions. [2019-09-08 11:01:36,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:01:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 59114 states and 84744 transitions. [2019-09-08 11:01:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:01:36,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:36,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:36,268 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash -184854122, now seen corresponding path program 1 times [2019-09-08 11:01:36,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:36,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:36,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:36,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:36,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:36,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:36,340 INFO L87 Difference]: Start difference. First operand 59114 states and 84744 transitions. Second operand 3 states.