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.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:49:52,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:49:52,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:49:52,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:49:52,732 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:49:52,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:49:52,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:49:52,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:49:52,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:49:52,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:49:52,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:49:52,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:49:52,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:49:52,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:49:52,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:49:52,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:49:52,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:49:52,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:49:52,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:49:52,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:49:52,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:49:52,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:49:52,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:49:52,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:49:52,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:49:52,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:49:52,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:49:52,757 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:49:52,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:49:52,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:49:52,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:49:52,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:49:52,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:49:52,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:49:52,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:49:52,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:49:52,763 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:49:52,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:49:52,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:49:52,764 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:49:52,765 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:49:52,766 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 12:49:52,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:49:52,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:49:52,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:49:52,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:49:52,782 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:49:52,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:49:52,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:49:52,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:49:52,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:49:52,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:49:52,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:49:52,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:49:52,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:49:52,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:49:52,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:49:52,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:49:52,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:49:52,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:49:52,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:49:52,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:49:52,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:49:52,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:49:52,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:49:52,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:49:52,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:49:52,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:49:52,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:49:52,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:49:52,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:49:52,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:49:52,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:49:52,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:49:52,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:49:52,833 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:49:52,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:49:52,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9e523b1/8272470060d44d80b2d5eeeb21bff35b/FLAGf6409b85d [2019-09-08 12:49:53,873 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:49:53,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:49:53,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9e523b1/8272470060d44d80b2d5eeeb21bff35b/FLAGf6409b85d [2019-09-08 12:49:54,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e9e523b1/8272470060d44d80b2d5eeeb21bff35b [2019-09-08 12:49:54,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:49:54,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:49:54,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:49:54,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:49:54,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:49:54,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:49:54" (1/1) ... [2019-09-08 12:49:54,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5599da21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:49:54, skipping insertion in model container [2019-09-08 12:49:54,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:49:54" (1/1) ... [2019-09-08 12:49:54,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:49:54,701 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:49:58,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:49:58,440 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:50:00,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:50:00,995 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:50:00,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00 WrapperNode [2019-09-08 12:50:00,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:50:00,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:50:00,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:50:00,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:50:01,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... [2019-09-08 12:50:01,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:50:01,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:50:01,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:50:01,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:50:01,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:50:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:50:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:50:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:50:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:50:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:50:01,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:50:01,619 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:50:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:50:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:50:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:50:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:50:01,620 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:50:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-08 12:50:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure node8 [2019-09-08 12:50:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:50:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:50:01,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:50:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:50:01,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:50:12,635 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:50:12,636 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:50:12,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:50:12 BoogieIcfgContainer [2019-09-08 12:50:12,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:50:12,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:50:12,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:50:12,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:50:12,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:49:54" (1/3) ... [2019-09-08 12:50:12,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e830f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:50:12, skipping insertion in model container [2019-09-08 12:50:12,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:50:00" (2/3) ... [2019-09-08 12:50:12,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758e830f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:50:12, skipping insertion in model container [2019-09-08 12:50:12,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:50:12" (3/3) ... [2019-09-08 12:50:12,648 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-08 12:50:12,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:50:12,669 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-09-08 12:50:12,686 INFO L252 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-09-08 12:50:12,733 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:50:12,734 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:50:12,734 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:50:12,734 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:50:12,734 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:50:12,734 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:50:12,735 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:50:12,735 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:50:12,735 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:50:12,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states. [2019-09-08 12:50:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:50:12,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:12,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:12,842 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:12,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1910714295, now seen corresponding path program 1 times [2019-09-08 12:50:12,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:12,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:12,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:12,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:12,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:13,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:13,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:13,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:13,939 INFO L87 Difference]: Start difference. First operand 3859 states. Second operand 5 states. [2019-09-08 12:50:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:17,654 INFO L93 Difference]: Finished difference Result 6610 states and 11768 transitions. [2019-09-08 12:50:17,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:17,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-09-08 12:50:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:17,711 INFO L225 Difference]: With dead ends: 6610 [2019-09-08 12:50:17,712 INFO L226 Difference]: Without dead ends: 3831 [2019-09-08 12:50:17,734 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 12:50:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-09-08 12:50:17,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3705. [2019-09-08 12:50:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3705 states. [2019-09-08 12:50:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3705 states and 5056 transitions. [2019-09-08 12:50:18,017 INFO L78 Accepts]: Start accepts. Automaton has 3705 states and 5056 transitions. Word has length 120 [2019-09-08 12:50:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:18,020 INFO L475 AbstractCegarLoop]: Abstraction has 3705 states and 5056 transitions. [2019-09-08 12:50:18,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3705 states and 5056 transitions. [2019-09-08 12:50:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 12:50:18,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:18,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:18,036 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2069207436, now seen corresponding path program 1 times [2019-09-08 12:50:18,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:18,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:18,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:18,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:18,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:18,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:18,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:18,501 INFO L87 Difference]: Start difference. First operand 3705 states and 5056 transitions. Second operand 5 states. [2019-09-08 12:50:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:21,578 INFO L93 Difference]: Finished difference Result 6318 states and 8893 transitions. [2019-09-08 12:50:21,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:21,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-09-08 12:50:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:21,599 INFO L225 Difference]: With dead ends: 6318 [2019-09-08 12:50:21,600 INFO L226 Difference]: Without dead ends: 3385 [2019-09-08 12:50:21,609 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 12:50:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2019-09-08 12:50:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2019-09-08 12:50:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2019-09-08 12:50:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4670 transitions. [2019-09-08 12:50:21,761 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4670 transitions. Word has length 121 [2019-09-08 12:50:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 3385 states and 4670 transitions. [2019-09-08 12:50:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4670 transitions. [2019-09-08 12:50:21,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 12:50:21,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:21,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:21,786 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:21,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1671511983, now seen corresponding path program 1 times [2019-09-08 12:50:21,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:21,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:22,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:22,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:22,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:22,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:22,280 INFO L87 Difference]: Start difference. First operand 3385 states and 4670 transitions. Second operand 5 states. [2019-09-08 12:50:24,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:24,150 INFO L93 Difference]: Finished difference Result 5998 states and 8505 transitions. [2019-09-08 12:50:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:24,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-08 12:50:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:24,169 INFO L225 Difference]: With dead ends: 5998 [2019-09-08 12:50:24,170 INFO L226 Difference]: Without dead ends: 3036 [2019-09-08 12:50:24,177 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 12:50:24,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2019-09-08 12:50:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3036. [2019-09-08 12:50:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3036 states. [2019-09-08 12:50:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 4287 transitions. [2019-09-08 12:50:24,290 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 4287 transitions. Word has length 122 [2019-09-08 12:50:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:24,291 INFO L475 AbstractCegarLoop]: Abstraction has 3036 states and 4287 transitions. [2019-09-08 12:50:24,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:24,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 4287 transitions. [2019-09-08 12:50:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:50:24,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:24,301 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:24,302 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:24,302 INFO L82 PathProgramCache]: Analyzing trace with hash -949726882, now seen corresponding path program 1 times [2019-09-08 12:50:24,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:24,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:24,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:24,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:24,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:24,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:24,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:24,629 INFO L87 Difference]: Start difference. First operand 3036 states and 4287 transitions. Second operand 5 states. [2019-09-08 12:50:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:26,778 INFO L93 Difference]: Finished difference Result 5649 states and 8120 transitions. [2019-09-08 12:50:26,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:26,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-09-08 12:50:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:26,794 INFO L225 Difference]: With dead ends: 5649 [2019-09-08 12:50:26,794 INFO L226 Difference]: Without dead ends: 2908 [2019-09-08 12:50:26,801 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 12:50:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2019-09-08 12:50:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2019-09-08 12:50:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2908 states. [2019-09-08 12:50:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4141 transitions. [2019-09-08 12:50:26,904 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4141 transitions. Word has length 123 [2019-09-08 12:50:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:26,906 INFO L475 AbstractCegarLoop]: Abstraction has 2908 states and 4141 transitions. [2019-09-08 12:50:26,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4141 transitions. [2019-09-08 12:50:26,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 12:50:26,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:26,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:26,914 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:26,915 INFO L82 PathProgramCache]: Analyzing trace with hash 939412243, now seen corresponding path program 1 times [2019-09-08 12:50:26,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:26,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:26,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:26,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:26,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:27,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:27,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:27,179 INFO L87 Difference]: Start difference. First operand 2908 states and 4141 transitions. Second operand 5 states. [2019-09-08 12:50:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:28,935 INFO L93 Difference]: Finished difference Result 5521 states and 7972 transitions. [2019-09-08 12:50:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:28,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-08 12:50:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:28,956 INFO L225 Difference]: With dead ends: 5521 [2019-09-08 12:50:28,957 INFO L226 Difference]: Without dead ends: 2802 [2019-09-08 12:50:28,964 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 12:50:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2019-09-08 12:50:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 2802. [2019-09-08 12:50:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-09-08 12:50:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4025 transitions. [2019-09-08 12:50:29,140 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4025 transitions. Word has length 124 [2019-09-08 12:50:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:29,141 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 4025 transitions. [2019-09-08 12:50:29,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4025 transitions. [2019-09-08 12:50:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 12:50:29,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:29,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:29,150 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:29,150 INFO L82 PathProgramCache]: Analyzing trace with hash 499065082, now seen corresponding path program 1 times [2019-09-08 12:50:29,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:29,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:29,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:29,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:29,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:29,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:29,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:29,434 INFO L87 Difference]: Start difference. First operand 2802 states and 4025 transitions. Second operand 5 states. [2019-09-08 12:50:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:31,106 INFO L93 Difference]: Finished difference Result 5415 states and 7854 transitions. [2019-09-08 12:50:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:31,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-08 12:50:31,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:31,121 INFO L225 Difference]: With dead ends: 5415 [2019-09-08 12:50:31,121 INFO L226 Difference]: Without dead ends: 2752 [2019-09-08 12:50:31,128 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 12:50:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2019-09-08 12:50:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2752. [2019-09-08 12:50:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2752 states. [2019-09-08 12:50:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3969 transitions. [2019-09-08 12:50:31,236 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3969 transitions. Word has length 125 [2019-09-08 12:50:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:31,237 INFO L475 AbstractCegarLoop]: Abstraction has 2752 states and 3969 transitions. [2019-09-08 12:50:31,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3969 transitions. [2019-09-08 12:50:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 12:50:31,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:31,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:31,244 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:31,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:31,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2041572273, now seen corresponding path program 1 times [2019-09-08 12:50:31,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:31,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:31,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:31,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:31,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:31,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:31,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:31,497 INFO L87 Difference]: Start difference. First operand 2752 states and 3969 transitions. Second operand 5 states. [2019-09-08 12:50:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:33,202 INFO L93 Difference]: Finished difference Result 5365 states and 7796 transitions. [2019-09-08 12:50:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:33,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-09-08 12:50:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:33,213 INFO L225 Difference]: With dead ends: 5365 [2019-09-08 12:50:33,214 INFO L226 Difference]: Without dead ends: 2721 [2019-09-08 12:50:33,219 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 12:50:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-09-08 12:50:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2721. [2019-09-08 12:50:33,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2019-09-08 12:50:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3934 transitions. [2019-09-08 12:50:33,330 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3934 transitions. Word has length 126 [2019-09-08 12:50:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:33,331 INFO L475 AbstractCegarLoop]: Abstraction has 2721 states and 3934 transitions. [2019-09-08 12:50:33,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3934 transitions. [2019-09-08 12:50:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 12:50:33,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:33,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:33,338 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1952897350, now seen corresponding path program 1 times [2019-09-08 12:50:33,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:33,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:33,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:33,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:50:33,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:50:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:50:33,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:50:33,575 INFO L87 Difference]: Start difference. First operand 2721 states and 3934 transitions. Second operand 5 states. [2019-09-08 12:50:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:35,346 INFO L93 Difference]: Finished difference Result 5334 states and 7759 transitions. [2019-09-08 12:50:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:50:35,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-08 12:50:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:35,357 INFO L225 Difference]: With dead ends: 5334 [2019-09-08 12:50:35,357 INFO L226 Difference]: Without dead ends: 2710 [2019-09-08 12:50:35,363 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 12:50:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2710 states. [2019-09-08 12:50:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2710 to 2710. [2019-09-08 12:50:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:50:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3920 transitions. [2019-09-08 12:50:35,482 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3920 transitions. Word has length 127 [2019-09-08 12:50:35,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:35,483 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3920 transitions. [2019-09-08 12:50:35,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:50:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3920 transitions. [2019-09-08 12:50:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:50:35,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:35,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:35,490 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:35,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:35,490 INFO L82 PathProgramCache]: Analyzing trace with hash 694993039, now seen corresponding path program 1 times [2019-09-08 12:50:35,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:35,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:35,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:35,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:35,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:36,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:36,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:50:36,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:50:36,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:50:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:50:36,126 INFO L87 Difference]: Start difference. First operand 2710 states and 3920 transitions. Second operand 8 states. [2019-09-08 12:50:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:40,266 INFO L93 Difference]: Finished difference Result 4462 states and 6222 transitions. [2019-09-08 12:50:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:50:40,266 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-09-08 12:50:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:40,282 INFO L225 Difference]: With dead ends: 4462 [2019-09-08 12:50:40,282 INFO L226 Difference]: Without dead ends: 3374 [2019-09-08 12:50:40,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:50:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2019-09-08 12:50:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2710. [2019-09-08 12:50:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:50:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3919 transitions. [2019-09-08 12:50:40,426 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3919 transitions. Word has length 128 [2019-09-08 12:50:40,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:40,426 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3919 transitions. [2019-09-08 12:50:40,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:50:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3919 transitions. [2019-09-08 12:50:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:50:40,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:40,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:40,433 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1069101216, now seen corresponding path program 1 times [2019-09-08 12:50:40,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:40,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:40,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:40,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:40,876 INFO L87 Difference]: Start difference. First operand 2710 states and 3919 transitions. Second operand 9 states. [2019-09-08 12:50:46,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:46,414 INFO L93 Difference]: Finished difference Result 4839 states and 7017 transitions. [2019-09-08 12:50:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:46,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 12:50:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:46,428 INFO L225 Difference]: With dead ends: 4839 [2019-09-08 12:50:46,428 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:50:46,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:50:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:50:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:50:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3918 transitions. [2019-09-08 12:50:46,584 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3918 transitions. Word has length 128 [2019-09-08 12:50:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:46,584 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3918 transitions. [2019-09-08 12:50:46,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3918 transitions. [2019-09-08 12:50:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 12:50:46,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:46,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:46,591 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:46,592 INFO L82 PathProgramCache]: Analyzing trace with hash -839566570, now seen corresponding path program 1 times [2019-09-08 12:50:46,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:46,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:46,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:46,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:46,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:46,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:46,913 INFO L87 Difference]: Start difference. First operand 2710 states and 3918 transitions. Second operand 9 states. [2019-09-08 12:50:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:52,393 INFO L93 Difference]: Finished difference Result 3776 states and 5497 transitions. [2019-09-08 12:50:52,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:50:52,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-09-08 12:50:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:52,403 INFO L225 Difference]: With dead ends: 3776 [2019-09-08 12:50:52,403 INFO L226 Difference]: Without dead ends: 3187 [2019-09-08 12:50:52,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:50:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-09-08 12:50:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2710. [2019-09-08 12:50:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:50:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3917 transitions. [2019-09-08 12:50:52,565 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3917 transitions. Word has length 128 [2019-09-08 12:50:52,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:52,565 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3917 transitions. [2019-09-08 12:50:52,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3917 transitions. [2019-09-08 12:50:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:50:52,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:52,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:52,571 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:52,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1345754422, now seen corresponding path program 1 times [2019-09-08 12:50:52,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:52,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:52,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:52,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:52,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:52,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:52,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:52,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:52,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:52,890 INFO L87 Difference]: Start difference. First operand 2710 states and 3917 transitions. Second operand 9 states. [2019-09-08 12:50:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:50:59,252 INFO L93 Difference]: Finished difference Result 5174 states and 7506 transitions. [2019-09-08 12:50:59,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:50:59,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:50:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:50:59,263 INFO L225 Difference]: With dead ends: 5174 [2019-09-08 12:50:59,263 INFO L226 Difference]: Without dead ends: 4594 [2019-09-08 12:50:59,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:50:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-08 12:50:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-08 12:50:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:50:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3915 transitions. [2019-09-08 12:50:59,463 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3915 transitions. Word has length 130 [2019-09-08 12:50:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:50:59,466 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3915 transitions. [2019-09-08 12:50:59,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:50:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3915 transitions. [2019-09-08 12:50:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:50:59,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:50:59,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:50:59,480 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:50:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:50:59,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2143106549, now seen corresponding path program 1 times [2019-09-08 12:50:59,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:50:59,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:50:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:50:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:50:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:50:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:50:59,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:50:59,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:50:59,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:50:59,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:50:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:50:59,856 INFO L87 Difference]: Start difference. First operand 2710 states and 3915 transitions. Second operand 9 states. [2019-09-08 12:51:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:06,309 INFO L93 Difference]: Finished difference Result 4928 states and 7146 transitions. [2019-09-08 12:51:06,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:06,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:06,318 INFO L225 Difference]: With dead ends: 4928 [2019-09-08 12:51:06,318 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:51:06,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:06,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:51:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:51:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3913 transitions. [2019-09-08 12:51:06,510 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3913 transitions. Word has length 130 [2019-09-08 12:51:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:06,511 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3913 transitions. [2019-09-08 12:51:06,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3913 transitions. [2019-09-08 12:51:06,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:51:06,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:06,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:06,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash 462471382, now seen corresponding path program 1 times [2019-09-08 12:51:06,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:06,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:06,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:06,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:06,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:06,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:06,889 INFO L87 Difference]: Start difference. First operand 2710 states and 3913 transitions. Second operand 9 states. [2019-09-08 12:51:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:11,971 INFO L93 Difference]: Finished difference Result 4285 states and 6203 transitions. [2019-09-08 12:51:11,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:51:11,971 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:11,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:11,978 INFO L225 Difference]: With dead ends: 4285 [2019-09-08 12:51:11,978 INFO L226 Difference]: Without dead ends: 3187 [2019-09-08 12:51:11,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:51:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2019-09-08 12:51:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2710. [2019-09-08 12:51:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3911 transitions. [2019-09-08 12:51:12,166 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3911 transitions. Word has length 130 [2019-09-08 12:51:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:12,167 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3911 transitions. [2019-09-08 12:51:12,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3911 transitions. [2019-09-08 12:51:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:51:12,172 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:12,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:12,173 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1538510824, now seen corresponding path program 1 times [2019-09-08 12:51:12,173 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:12,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:12,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:12,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:12,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:12,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:12,515 INFO L87 Difference]: Start difference. First operand 2710 states and 3911 transitions. Second operand 9 states. [2019-09-08 12:51:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:19,548 INFO L93 Difference]: Finished difference Result 4960 states and 7197 transitions. [2019-09-08 12:51:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:19,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:19,555 INFO L225 Difference]: With dead ends: 4960 [2019-09-08 12:51:19,555 INFO L226 Difference]: Without dead ends: 4594 [2019-09-08 12:51:19,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-08 12:51:19,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-08 12:51:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3910 transitions. [2019-09-08 12:51:19,692 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3910 transitions. Word has length 130 [2019-09-08 12:51:19,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:19,692 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3910 transitions. [2019-09-08 12:51:19,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3910 transitions. [2019-09-08 12:51:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:51:19,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:19,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:19,698 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:19,698 INFO L82 PathProgramCache]: Analyzing trace with hash 275679986, now seen corresponding path program 1 times [2019-09-08 12:51:19,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:20,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:20,255 INFO L87 Difference]: Start difference. First operand 2710 states and 3910 transitions. Second operand 9 states. [2019-09-08 12:51:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:26,938 INFO L93 Difference]: Finished difference Result 4824 states and 6990 transitions. [2019-09-08 12:51:26,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:26,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:26,944 INFO L225 Difference]: With dead ends: 4824 [2019-09-08 12:51:26,944 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:51:26,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:51:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:51:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3909 transitions. [2019-09-08 12:51:27,129 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3909 transitions. Word has length 130 [2019-09-08 12:51:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:27,130 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3909 transitions. [2019-09-08 12:51:27,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:27,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3909 transitions. [2019-09-08 12:51:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:51:27,133 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:27,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:27,134 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2003857804, now seen corresponding path program 1 times [2019-09-08 12:51:27,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:27,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:27,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:27,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:27,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:27,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:27,452 INFO L87 Difference]: Start difference. First operand 2710 states and 3909 transitions. Second operand 9 states. [2019-09-08 12:51:34,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:34,174 INFO L93 Difference]: Finished difference Result 4839 states and 7007 transitions. [2019-09-08 12:51:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:34,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:34,178 INFO L225 Difference]: With dead ends: 4839 [2019-09-08 12:51:34,179 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:51:34,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:51:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:51:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3908 transitions. [2019-09-08 12:51:34,309 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3908 transitions. Word has length 130 [2019-09-08 12:51:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:34,309 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3908 transitions. [2019-09-08 12:51:34,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3908 transitions. [2019-09-08 12:51:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 12:51:34,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:34,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:34,313 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:34,313 INFO L82 PathProgramCache]: Analyzing trace with hash -153710255, now seen corresponding path program 1 times [2019-09-08 12:51:34,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:34,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:34,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:34,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:34,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:34,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:34,582 INFO L87 Difference]: Start difference. First operand 2710 states and 3908 transitions. Second operand 9 states. [2019-09-08 12:51:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:41,718 INFO L93 Difference]: Finished difference Result 4998 states and 7235 transitions. [2019-09-08 12:51:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:41,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-09-08 12:51:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:41,723 INFO L225 Difference]: With dead ends: 4998 [2019-09-08 12:51:41,723 INFO L226 Difference]: Without dead ends: 4594 [2019-09-08 12:51:41,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:41,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-08 12:51:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-08 12:51:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3907 transitions. [2019-09-08 12:51:41,860 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3907 transitions. Word has length 130 [2019-09-08 12:51:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:41,860 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3907 transitions. [2019-09-08 12:51:41,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3907 transitions. [2019-09-08 12:51:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:51:41,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:41,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:41,865 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:41,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1726560325, now seen corresponding path program 1 times [2019-09-08 12:51:41,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:41,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:42,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:42,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:42,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:42,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:42,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:42,218 INFO L87 Difference]: Start difference. First operand 2710 states and 3907 transitions. Second operand 9 states. [2019-09-08 12:51:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:48,929 INFO L93 Difference]: Finished difference Result 4816 states and 6963 transitions. [2019-09-08 12:51:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:48,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:51:48,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:48,937 INFO L225 Difference]: With dead ends: 4816 [2019-09-08 12:51:48,938 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:51:48,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:51:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:51:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3905 transitions. [2019-09-08 12:51:49,101 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3905 transitions. Word has length 132 [2019-09-08 12:51:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:49,101 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3905 transitions. [2019-09-08 12:51:49,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3905 transitions. [2019-09-08 12:51:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:51:49,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:49,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:49,105 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1662178282, now seen corresponding path program 1 times [2019-09-08 12:51:49,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:49,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:49,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:49,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:49,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:49,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:49,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:49,358 INFO L87 Difference]: Start difference. First operand 2710 states and 3905 transitions. Second operand 9 states. [2019-09-08 12:51:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:51:56,355 INFO L93 Difference]: Finished difference Result 4964 states and 7176 transitions. [2019-09-08 12:51:56,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:51:56,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:51:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:51:56,363 INFO L225 Difference]: With dead ends: 4964 [2019-09-08 12:51:56,363 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:51:56,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:51:56,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:51:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:51:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:51:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3903 transitions. [2019-09-08 12:51:56,536 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3903 transitions. Word has length 132 [2019-09-08 12:51:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:51:56,536 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3903 transitions. [2019-09-08 12:51:56,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:51:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3903 transitions. [2019-09-08 12:51:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:51:56,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:51:56,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:51:56,542 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:51:56,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:51:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash -26279808, now seen corresponding path program 1 times [2019-09-08 12:51:56,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:51:56,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:51:56,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:56,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:51:56,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:51:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:51:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:51:56,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:51:56,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:51:56,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:51:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:51:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:51:56,838 INFO L87 Difference]: Start difference. First operand 2710 states and 3903 transitions. Second operand 9 states. [2019-09-08 12:52:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:02,721 INFO L93 Difference]: Finished difference Result 4998 states and 7207 transitions. [2019-09-08 12:52:02,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:02,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:02,726 INFO L225 Difference]: With dead ends: 4998 [2019-09-08 12:52:02,726 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:52:02,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:52:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:52:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3901 transitions. [2019-09-08 12:52:02,886 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3901 transitions. Word has length 132 [2019-09-08 12:52:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:02,887 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3901 transitions. [2019-09-08 12:52:02,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3901 transitions. [2019-09-08 12:52:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:02,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:02,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:02,891 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -830173217, now seen corresponding path program 1 times [2019-09-08 12:52:02,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:02,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:02,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:02,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:03,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:03,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:03,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:03,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:03,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:03,187 INFO L87 Difference]: Start difference. First operand 2710 states and 3901 transitions. Second operand 9 states. [2019-09-08 12:52:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:10,429 INFO L93 Difference]: Finished difference Result 5264 states and 7584 transitions. [2019-09-08 12:52:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:10,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:10,436 INFO L225 Difference]: With dead ends: 5264 [2019-09-08 12:52:10,436 INFO L226 Difference]: Without dead ends: 4594 [2019-09-08 12:52:10,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:10,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4594 states. [2019-09-08 12:52:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4594 to 2710. [2019-09-08 12:52:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3899 transitions. [2019-09-08 12:52:10,600 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3899 transitions. Word has length 132 [2019-09-08 12:52:10,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:10,600 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3899 transitions. [2019-09-08 12:52:10,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3899 transitions. [2019-09-08 12:52:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:10,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:10,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:10,604 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 211463443, now seen corresponding path program 1 times [2019-09-08 12:52:10,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:10,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:10,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:10,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:10,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:10,862 INFO L87 Difference]: Start difference. First operand 2710 states and 3899 transitions. Second operand 9 states. [2019-09-08 12:52:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:18,102 INFO L93 Difference]: Finished difference Result 4812 states and 6949 transitions. [2019-09-08 12:52:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:18,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:18,107 INFO L225 Difference]: With dead ends: 4812 [2019-09-08 12:52:18,107 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:52:18,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:52:18,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:52:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3897 transitions. [2019-09-08 12:52:18,274 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3897 transitions. Word has length 132 [2019-09-08 12:52:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:18,275 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3897 transitions. [2019-09-08 12:52:18,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3897 transitions. [2019-09-08 12:52:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:18,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:18,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:18,278 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:18,279 INFO L82 PathProgramCache]: Analyzing trace with hash 119954600, now seen corresponding path program 1 times [2019-09-08 12:52:18,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:18,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:18,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:18,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:18,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:18,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:18,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:18,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:18,547 INFO L87 Difference]: Start difference. First operand 2710 states and 3897 transitions. Second operand 9 states. [2019-09-08 12:52:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:25,738 INFO L93 Difference]: Finished difference Result 4802 states and 6936 transitions. [2019-09-08 12:52:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:25,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:25,744 INFO L225 Difference]: With dead ends: 4802 [2019-09-08 12:52:25,744 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:52:25,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:25,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:52:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:52:25,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3895 transitions. [2019-09-08 12:52:25,922 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3895 transitions. Word has length 132 [2019-09-08 12:52:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:25,923 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3895 transitions. [2019-09-08 12:52:25,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3895 transitions. [2019-09-08 12:52:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:25,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:25,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:25,927 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:25,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1481055458, now seen corresponding path program 1 times [2019-09-08 12:52:25,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:25,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:26,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:26,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:26,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:26,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:26,230 INFO L87 Difference]: Start difference. First operand 2710 states and 3895 transitions. Second operand 9 states. [2019-09-08 12:52:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:33,353 INFO L93 Difference]: Finished difference Result 4812 states and 6943 transitions. [2019-09-08 12:52:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:33,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:33,359 INFO L225 Difference]: With dead ends: 4812 [2019-09-08 12:52:33,359 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:52:33,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:52:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:52:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3893 transitions. [2019-09-08 12:52:33,532 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3893 transitions. Word has length 132 [2019-09-08 12:52:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:33,532 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3893 transitions. [2019-09-08 12:52:33,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3893 transitions. [2019-09-08 12:52:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:33,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:33,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:33,537 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash -737415581, now seen corresponding path program 1 times [2019-09-08 12:52:33,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:33,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:33,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:33,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:33,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:33,884 INFO L87 Difference]: Start difference. First operand 2710 states and 3893 transitions. Second operand 9 states. [2019-09-08 12:52:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:41,125 INFO L93 Difference]: Finished difference Result 4944 states and 7129 transitions. [2019-09-08 12:52:41,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:41,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:41,131 INFO L225 Difference]: With dead ends: 4944 [2019-09-08 12:52:41,132 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:52:41,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:52:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:52:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:41,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3891 transitions. [2019-09-08 12:52:41,366 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3891 transitions. Word has length 132 [2019-09-08 12:52:41,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:41,366 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3891 transitions. [2019-09-08 12:52:41,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3891 transitions. [2019-09-08 12:52:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:41,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:41,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:41,369 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:41,370 INFO L82 PathProgramCache]: Analyzing trace with hash 719530290, now seen corresponding path program 1 times [2019-09-08 12:52:41,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:41,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:41,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:41,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:41,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:41,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:41,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:41,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:41,616 INFO L87 Difference]: Start difference. First operand 2710 states and 3891 transitions. Second operand 9 states. [2019-09-08 12:52:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:48,972 INFO L93 Difference]: Finished difference Result 4761 states and 6868 transitions. [2019-09-08 12:52:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:48,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:48,976 INFO L225 Difference]: With dead ends: 4761 [2019-09-08 12:52:48,976 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:52:48,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:52:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:52:49,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3890 transitions. [2019-09-08 12:52:49,156 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3890 transitions. Word has length 132 [2019-09-08 12:52:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:49,157 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3890 transitions. [2019-09-08 12:52:49,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3890 transitions. [2019-09-08 12:52:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:49,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:49,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:49,159 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash -66884006, now seen corresponding path program 1 times [2019-09-08 12:52:49,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:49,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:49,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:49,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:49,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:49,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:49,393 INFO L87 Difference]: Start difference. First operand 2710 states and 3890 transitions. Second operand 9 states. [2019-09-08 12:52:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:52:55,712 INFO L93 Difference]: Finished difference Result 4754 states and 6856 transitions. [2019-09-08 12:52:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:52:55,713 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:52:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:52:55,718 INFO L225 Difference]: With dead ends: 4754 [2019-09-08 12:52:55,718 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:52:55,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:52:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:52:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:52:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:52:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3889 transitions. [2019-09-08 12:52:55,946 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3889 transitions. Word has length 132 [2019-09-08 12:52:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:52:55,947 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3889 transitions. [2019-09-08 12:52:55,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:52:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3889 transitions. [2019-09-08 12:52:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:52:55,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:52:55,949 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:52:55,949 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:52:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:52:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1801895648, now seen corresponding path program 1 times [2019-09-08 12:52:55,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:52:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:52:55,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:55,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:52:55,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:52:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:52:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:52:56,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:52:56,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:52:56,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:52:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:52:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:52:56,252 INFO L87 Difference]: Start difference. First operand 2710 states and 3889 transitions. Second operand 9 states. [2019-09-08 12:53:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:03,357 INFO L93 Difference]: Finished difference Result 4769 states and 6872 transitions. [2019-09-08 12:53:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:03,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:03,363 INFO L225 Difference]: With dead ends: 4769 [2019-09-08 12:53:03,363 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:53:03,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:53:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:53:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3888 transitions. [2019-09-08 12:53:03,561 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3888 transitions. Word has length 132 [2019-09-08 12:53:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:03,561 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3888 transitions. [2019-09-08 12:53:03,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3888 transitions. [2019-09-08 12:53:03,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:03,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:03,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:03,564 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:03,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1708108863, now seen corresponding path program 1 times [2019-09-08 12:53:03,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:03,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:03,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:03,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:03,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:03,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:03,845 INFO L87 Difference]: Start difference. First operand 2710 states and 3888 transitions. Second operand 9 states. [2019-09-08 12:53:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:11,154 INFO L93 Difference]: Finished difference Result 4761 states and 6863 transitions. [2019-09-08 12:53:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:11,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:11,159 INFO L225 Difference]: With dead ends: 4761 [2019-09-08 12:53:11,159 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:53:11,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:53:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:53:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3887 transitions. [2019-09-08 12:53:11,349 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3887 transitions. Word has length 132 [2019-09-08 12:53:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:11,349 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3887 transitions. [2019-09-08 12:53:11,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3887 transitions. [2019-09-08 12:53:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:11,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:11,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:11,352 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:11,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:11,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1993031987, now seen corresponding path program 1 times [2019-09-08 12:53:11,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:11,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:11,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:11,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:11,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:11,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:11,577 INFO L87 Difference]: Start difference. First operand 2710 states and 3887 transitions. Second operand 9 states. [2019-09-08 12:53:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:17,063 INFO L93 Difference]: Finished difference Result 4588 states and 6567 transitions. [2019-09-08 12:53:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:17,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:17,068 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 12:53:17,069 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:53:17,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:53:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:53:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:53:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3886 transitions. [2019-09-08 12:53:17,275 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3886 transitions. Word has length 132 [2019-09-08 12:53:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:17,275 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3886 transitions. [2019-09-08 12:53:17,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3886 transitions. [2019-09-08 12:53:17,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:17,279 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:17,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:17,279 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1821851494, now seen corresponding path program 1 times [2019-09-08 12:53:17,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:17,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:17,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:17,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:17,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:17,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:17,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:17,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:17,581 INFO L87 Difference]: Start difference. First operand 2710 states and 3886 transitions. Second operand 9 states. [2019-09-08 12:53:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:24,099 INFO L93 Difference]: Finished difference Result 4862 states and 6996 transitions. [2019-09-08 12:53:24,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:24,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:24,103 INFO L225 Difference]: With dead ends: 4862 [2019-09-08 12:53:24,103 INFO L226 Difference]: Without dead ends: 4558 [2019-09-08 12:53:24,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-09-08 12:53:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 2710. [2019-09-08 12:53:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3885 transitions. [2019-09-08 12:53:24,314 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3885 transitions. Word has length 132 [2019-09-08 12:53:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:24,314 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3885 transitions. [2019-09-08 12:53:24,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3885 transitions. [2019-09-08 12:53:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:24,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:24,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:24,317 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1086803298, now seen corresponding path program 1 times [2019-09-08 12:53:24,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:24,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:24,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:24,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:24,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:24,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:24,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:24,605 INFO L87 Difference]: Start difference. First operand 2710 states and 3885 transitions. Second operand 9 states. [2019-09-08 12:53:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:30,175 INFO L93 Difference]: Finished difference Result 4588 states and 6564 transitions. [2019-09-08 12:53:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:30,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:30,181 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 12:53:30,181 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:53:30,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:53:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:53:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:53:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3884 transitions. [2019-09-08 12:53:30,456 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3884 transitions. Word has length 132 [2019-09-08 12:53:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:30,456 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3884 transitions. [2019-09-08 12:53:30,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3884 transitions. [2019-09-08 12:53:30,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:30,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:30,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:30,459 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:30,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:30,460 INFO L82 PathProgramCache]: Analyzing trace with hash 113248819, now seen corresponding path program 1 times [2019-09-08 12:53:30,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:30,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:30,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:30,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:30,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:30,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:30,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:30,684 INFO L87 Difference]: Start difference. First operand 2710 states and 3884 transitions. Second operand 9 states. [2019-09-08 12:53:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:38,110 INFO L93 Difference]: Finished difference Result 4769 states and 6866 transitions. [2019-09-08 12:53:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:38,110 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:38,114 INFO L225 Difference]: With dead ends: 4769 [2019-09-08 12:53:38,114 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:53:38,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:53:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:53:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3883 transitions. [2019-09-08 12:53:38,339 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3883 transitions. Word has length 132 [2019-09-08 12:53:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:38,339 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3883 transitions. [2019-09-08 12:53:38,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3883 transitions. [2019-09-08 12:53:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 12:53:38,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:38,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:38,342 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash 121315274, now seen corresponding path program 1 times [2019-09-08 12:53:38,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:38,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:38,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:38,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:38,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:38,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:38,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:38,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:38,605 INFO L87 Difference]: Start difference. First operand 2710 states and 3883 transitions. Second operand 9 states. [2019-09-08 12:53:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:45,506 INFO L93 Difference]: Finished difference Result 4761 states and 6856 transitions. [2019-09-08 12:53:45,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:45,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-09-08 12:53:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:45,511 INFO L225 Difference]: With dead ends: 4761 [2019-09-08 12:53:45,511 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:53:45,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:53:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:53:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3882 transitions. [2019-09-08 12:53:45,741 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3882 transitions. Word has length 132 [2019-09-08 12:53:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:45,741 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3882 transitions. [2019-09-08 12:53:45,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3882 transitions. [2019-09-08 12:53:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:53:45,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:45,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:45,744 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:45,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1229319912, now seen corresponding path program 1 times [2019-09-08 12:53:45,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:45,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:45,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:45,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:45,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:45,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:45,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:45,972 INFO L87 Difference]: Start difference. First operand 2710 states and 3882 transitions. Second operand 9 states. [2019-09-08 12:53:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:53:53,259 INFO L93 Difference]: Finished difference Result 4720 states and 6781 transitions. [2019-09-08 12:53:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:53:53,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:53:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:53:53,265 INFO L225 Difference]: With dead ends: 4720 [2019-09-08 12:53:53,265 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:53:53,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:53:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:53:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:53:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:53:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3880 transitions. [2019-09-08 12:53:53,513 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3880 transitions. Word has length 134 [2019-09-08 12:53:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:53:53,513 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3880 transitions. [2019-09-08 12:53:53,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:53:53,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3880 transitions. [2019-09-08 12:53:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:53:53,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:53:53,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:53:53,516 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:53:53,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:53:53,516 INFO L82 PathProgramCache]: Analyzing trace with hash -749236097, now seen corresponding path program 1 times [2019-09-08 12:53:53,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:53:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:53:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:53,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:53:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:53:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:53:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:53:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:53:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:53:53,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:53:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:53:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:53:53,772 INFO L87 Difference]: Start difference. First operand 2710 states and 3880 transitions. Second operand 9 states. [2019-09-08 12:54:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:01,625 INFO L93 Difference]: Finished difference Result 4834 states and 6949 transitions. [2019-09-08 12:54:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:01,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:01,629 INFO L225 Difference]: With dead ends: 4834 [2019-09-08 12:54:01,629 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:54:01,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:54:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:54:01,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3878 transitions. [2019-09-08 12:54:01,886 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3878 transitions. Word has length 134 [2019-09-08 12:54:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:01,887 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3878 transitions. [2019-09-08 12:54:01,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3878 transitions. [2019-09-08 12:54:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:01,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:01,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:01,891 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:01,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1527859806, now seen corresponding path program 1 times [2019-09-08 12:54:01,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:02,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:02,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:02,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:02,135 INFO L87 Difference]: Start difference. First operand 2710 states and 3878 transitions. Second operand 9 states. [2019-09-08 12:54:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:09,693 INFO L93 Difference]: Finished difference Result 4710 states and 6766 transitions. [2019-09-08 12:54:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:09,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:09,699 INFO L225 Difference]: With dead ends: 4710 [2019-09-08 12:54:09,699 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:54:09,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:54:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:54:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3876 transitions. [2019-09-08 12:54:09,949 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3876 transitions. Word has length 134 [2019-09-08 12:54:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:09,949 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3876 transitions. [2019-09-08 12:54:09,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3876 transitions. [2019-09-08 12:54:09,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:09,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:09,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:09,952 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:09,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:09,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1087460810, now seen corresponding path program 1 times [2019-09-08 12:54:09,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:09,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:09,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:09,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:10,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:10,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:10,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:10,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:10,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:10,202 INFO L87 Difference]: Start difference. First operand 2710 states and 3876 transitions. Second operand 9 states. [2019-09-08 12:54:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:17,647 INFO L93 Difference]: Finished difference Result 4720 states and 6775 transitions. [2019-09-08 12:54:17,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:17,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:17,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:17,652 INFO L225 Difference]: With dead ends: 4720 [2019-09-08 12:54:17,652 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:54:17,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:54:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:54:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3874 transitions. [2019-09-08 12:54:17,904 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3874 transitions. Word has length 134 [2019-09-08 12:54:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:17,904 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3874 transitions. [2019-09-08 12:54:17,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3874 transitions. [2019-09-08 12:54:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:17,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:17,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:17,907 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash -485279045, now seen corresponding path program 1 times [2019-09-08 12:54:17,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:17,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:17,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:18,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:18,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:18,147 INFO L87 Difference]: Start difference. First operand 2710 states and 3874 transitions. Second operand 9 states. [2019-09-08 12:54:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:25,517 INFO L93 Difference]: Finished difference Result 4720 states and 6771 transitions. [2019-09-08 12:54:25,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:25,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:25,522 INFO L225 Difference]: With dead ends: 4720 [2019-09-08 12:54:25,523 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:54:25,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:54:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:54:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3872 transitions. [2019-09-08 12:54:25,798 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3872 transitions. Word has length 134 [2019-09-08 12:54:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:25,799 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3872 transitions. [2019-09-08 12:54:25,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3872 transitions. [2019-09-08 12:54:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:25,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:25,801 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:25,802 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:25,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:25,802 INFO L82 PathProgramCache]: Analyzing trace with hash -5195230, now seen corresponding path program 1 times [2019-09-08 12:54:25,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:25,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:25,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:26,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:26,010 INFO L87 Difference]: Start difference. First operand 2710 states and 3872 transitions. Second operand 9 states. [2019-09-08 12:54:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:33,908 INFO L93 Difference]: Finished difference Result 4834 states and 6939 transitions. [2019-09-08 12:54:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:33,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:33,913 INFO L225 Difference]: With dead ends: 4834 [2019-09-08 12:54:33,913 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:54:33,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:54:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:54:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3870 transitions. [2019-09-08 12:54:34,176 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3870 transitions. Word has length 134 [2019-09-08 12:54:34,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:34,176 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3870 transitions. [2019-09-08 12:54:34,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3870 transitions. [2019-09-08 12:54:34,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:34,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:34,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:34,179 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:34,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1013580119, now seen corresponding path program 1 times [2019-09-08 12:54:34,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:34,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:34,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:34,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:34,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:34,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:34,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:34,395 INFO L87 Difference]: Start difference. First operand 2710 states and 3870 transitions. Second operand 9 states. [2019-09-08 12:54:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:40,433 INFO L93 Difference]: Finished difference Result 4594 states and 6556 transitions. [2019-09-08 12:54:40,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:40,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:40,438 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 12:54:40,438 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:54:40,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:54:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:54:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:54:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3868 transitions. [2019-09-08 12:54:40,714 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3868 transitions. Word has length 134 [2019-09-08 12:54:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:40,714 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3868 transitions. [2019-09-08 12:54:40,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:40,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3868 transitions. [2019-09-08 12:54:40,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:40,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:40,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:40,717 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:40,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1702899111, now seen corresponding path program 1 times [2019-09-08 12:54:40,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:40,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:40,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:40,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:40,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:40,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:40,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:40,944 INFO L87 Difference]: Start difference. First operand 2710 states and 3868 transitions. Second operand 9 states. [2019-09-08 12:54:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:48,485 INFO L93 Difference]: Finished difference Result 4710 states and 6752 transitions. [2019-09-08 12:54:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:48,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:48,490 INFO L225 Difference]: With dead ends: 4710 [2019-09-08 12:54:48,490 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:54:48,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:54:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:54:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3866 transitions. [2019-09-08 12:54:48,760 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3866 transitions. Word has length 134 [2019-09-08 12:54:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:48,760 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3866 transitions. [2019-09-08 12:54:48,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3866 transitions. [2019-09-08 12:54:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:48,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:48,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:48,763 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -450364780, now seen corresponding path program 1 times [2019-09-08 12:54:48,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:48,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:48,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:48,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:48,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:48,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:48,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:48,987 INFO L87 Difference]: Start difference. First operand 2710 states and 3866 transitions. Second operand 9 states. [2019-09-08 12:54:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:54:56,580 INFO L93 Difference]: Finished difference Result 4710 states and 6750 transitions. [2019-09-08 12:54:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:54:56,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:54:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:54:56,584 INFO L225 Difference]: With dead ends: 4710 [2019-09-08 12:54:56,584 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:54:56,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:54:56,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:54:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:54:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:54:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3864 transitions. [2019-09-08 12:54:56,859 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3864 transitions. Word has length 134 [2019-09-08 12:54:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:54:56,859 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3864 transitions. [2019-09-08 12:54:56,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:54:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3864 transitions. [2019-09-08 12:54:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:54:56,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:54:56,861 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:54:56,861 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:54:56,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:54:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1693121103, now seen corresponding path program 1 times [2019-09-08 12:54:56,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:54:56,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:54:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:56,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:54:56,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:54:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:54:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:54:57,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:54:57,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:54:57,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:54:57,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:54:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:54:57,094 INFO L87 Difference]: Start difference. First operand 2710 states and 3864 transitions. Second operand 9 states. [2019-09-08 12:55:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:04,544 INFO L93 Difference]: Finished difference Result 4706 states and 6742 transitions. [2019-09-08 12:55:04,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:04,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:04,549 INFO L225 Difference]: With dead ends: 4706 [2019-09-08 12:55:04,549 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:04,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:55:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:55:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3862 transitions. [2019-09-08 12:55:04,830 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3862 transitions. Word has length 134 [2019-09-08 12:55:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:04,830 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3862 transitions. [2019-09-08 12:55:04,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3862 transitions. [2019-09-08 12:55:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:04,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:04,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:04,833 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1309753994, now seen corresponding path program 1 times [2019-09-08 12:55:04,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:04,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:05,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:05,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:05,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:05,078 INFO L87 Difference]: Start difference. First operand 2710 states and 3862 transitions. Second operand 9 states. [2019-09-08 12:55:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:12,402 INFO L93 Difference]: Finished difference Result 4710 states and 6744 transitions. [2019-09-08 12:55:12,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:12,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:12,406 INFO L225 Difference]: With dead ends: 4710 [2019-09-08 12:55:12,407 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:12,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:55:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:55:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3860 transitions. [2019-09-08 12:55:12,696 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3860 transitions. Word has length 134 [2019-09-08 12:55:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3860 transitions. [2019-09-08 12:55:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3860 transitions. [2019-09-08 12:55:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:12,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:12,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:12,701 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1999458270, now seen corresponding path program 1 times [2019-09-08 12:55:12,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:12,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:12,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:12,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:12,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:12,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:12,943 INFO L87 Difference]: Start difference. First operand 2710 states and 3860 transitions. Second operand 9 states. [2019-09-08 12:55:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:19,010 INFO L93 Difference]: Finished difference Result 4594 states and 6544 transitions. [2019-09-08 12:55:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:19,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:19,016 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 12:55:19,017 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:55:19,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:55:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:55:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:55:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:19,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3858 transitions. [2019-09-08 12:55:19,396 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3858 transitions. Word has length 134 [2019-09-08 12:55:19,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:19,396 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3858 transitions. [2019-09-08 12:55:19,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3858 transitions. [2019-09-08 12:55:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:19,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:19,400 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1599102211, now seen corresponding path program 1 times [2019-09-08 12:55:19,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:19,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:19,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:19,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:19,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:19,607 INFO L87 Difference]: Start difference. First operand 2710 states and 3858 transitions. Second operand 9 states. [2019-09-08 12:55:27,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:27,571 INFO L93 Difference]: Finished difference Result 4818 states and 6894 transitions. [2019-09-08 12:55:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:27,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:27,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:27,577 INFO L225 Difference]: With dead ends: 4818 [2019-09-08 12:55:27,577 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:55:27,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:55:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:55:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3856 transitions. [2019-09-08 12:55:27,929 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3856 transitions. Word has length 134 [2019-09-08 12:55:27,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:27,930 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3856 transitions. [2019-09-08 12:55:27,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3856 transitions. [2019-09-08 12:55:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:27,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:27,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:27,932 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash 947000823, now seen corresponding path program 1 times [2019-09-08 12:55:27,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:28,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:28,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:28,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:28,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:28,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:28,142 INFO L87 Difference]: Start difference. First operand 2710 states and 3856 transitions. Second operand 9 states. [2019-09-08 12:55:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:35,506 INFO L93 Difference]: Finished difference Result 4716 states and 6741 transitions. [2019-09-08 12:55:35,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:35,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:35,513 INFO L225 Difference]: With dead ends: 4716 [2019-09-08 12:55:35,514 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:35,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:55:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:55:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3854 transitions. [2019-09-08 12:55:35,891 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3854 transitions. Word has length 134 [2019-09-08 12:55:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:35,891 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3854 transitions. [2019-09-08 12:55:35,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3854 transitions. [2019-09-08 12:55:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:35,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:35,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:35,894 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:35,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:35,894 INFO L82 PathProgramCache]: Analyzing trace with hash -34998173, now seen corresponding path program 1 times [2019-09-08 12:55:35,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:35,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:35,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:35,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:35,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:36,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:36,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:36,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:36,104 INFO L87 Difference]: Start difference. First operand 2710 states and 3854 transitions. Second operand 9 states. [2019-09-08 12:55:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:43,614 INFO L93 Difference]: Finished difference Result 4689 states and 6704 transitions. [2019-09-08 12:55:43,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:43,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:43,620 INFO L225 Difference]: With dead ends: 4689 [2019-09-08 12:55:43,620 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:43,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:43,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:55:43,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:55:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3853 transitions. [2019-09-08 12:55:43,989 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3853 transitions. Word has length 134 [2019-09-08 12:55:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:43,989 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3853 transitions. [2019-09-08 12:55:43,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3853 transitions. [2019-09-08 12:55:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:43,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:43,991 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:43,992 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:43,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1567687842, now seen corresponding path program 1 times [2019-09-08 12:55:43,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:43,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:43,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:43,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:44,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:44,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:44,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:44,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:44,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:44,198 INFO L87 Difference]: Start difference. First operand 2710 states and 3853 transitions. Second operand 9 states. [2019-09-08 12:55:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:51,697 INFO L93 Difference]: Finished difference Result 4691 states and 6705 transitions. [2019-09-08 12:55:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:51,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:51,704 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 12:55:51,704 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:51,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:51,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:55:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:55:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:55:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3852 transitions. [2019-09-08 12:55:52,030 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3852 transitions. Word has length 134 [2019-09-08 12:55:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:55:52,030 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3852 transitions. [2019-09-08 12:55:52,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:55:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3852 transitions. [2019-09-08 12:55:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:55:52,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:55:52,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:55:52,034 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:55:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:55:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1487039590, now seen corresponding path program 1 times [2019-09-08 12:55:52,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:55:52,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:55:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:52,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:55:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:55:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:55:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:55:52,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:55:52,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:55:52,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:55:52,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:55:52,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:55:52,315 INFO L87 Difference]: Start difference. First operand 2710 states and 3852 transitions. Second operand 9 states. [2019-09-08 12:55:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:55:59,827 INFO L93 Difference]: Finished difference Result 4689 states and 6701 transitions. [2019-09-08 12:55:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:55:59,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:55:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:55:59,834 INFO L225 Difference]: With dead ends: 4689 [2019-09-08 12:55:59,834 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:55:59,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:55:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:56:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:56:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:00,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3851 transitions. [2019-09-08 12:56:00,160 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3851 transitions. Word has length 134 [2019-09-08 12:56:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:00,160 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3851 transitions. [2019-09-08 12:56:00,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3851 transitions. [2019-09-08 12:56:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:00,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:00,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:00,163 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1097686206, now seen corresponding path program 1 times [2019-09-08 12:56:00,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:00,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:00,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:00,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:00,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:00,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:00,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:00,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:00,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:00,382 INFO L87 Difference]: Start difference. First operand 2710 states and 3851 transitions. Second operand 9 states. [2019-09-08 12:56:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:06,542 INFO L93 Difference]: Finished difference Result 4584 states and 6521 transitions. [2019-09-08 12:56:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:06,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:06,548 INFO L225 Difference]: With dead ends: 4584 [2019-09-08 12:56:06,549 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:56:06,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:56:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:56:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:56:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3850 transitions. [2019-09-08 12:56:06,883 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3850 transitions. Word has length 134 [2019-09-08 12:56:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:06,883 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3850 transitions. [2019-09-08 12:56:06,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3850 transitions. [2019-09-08 12:56:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:06,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:06,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:06,886 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash 410645156, now seen corresponding path program 1 times [2019-09-08 12:56:06,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:06,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:06,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:06,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:07,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:07,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:07,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:07,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:07,133 INFO L87 Difference]: Start difference. First operand 2710 states and 3850 transitions. Second operand 9 states. [2019-09-08 12:56:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:14,571 INFO L93 Difference]: Finished difference Result 4697 states and 6705 transitions. [2019-09-08 12:56:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:14,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:14,577 INFO L225 Difference]: With dead ends: 4697 [2019-09-08 12:56:14,577 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:56:14,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:56:14,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:56:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3849 transitions. [2019-09-08 12:56:14,910 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3849 transitions. Word has length 134 [2019-09-08 12:56:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:14,911 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3849 transitions. [2019-09-08 12:56:14,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3849 transitions. [2019-09-08 12:56:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:14,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:14,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:14,913 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1945214812, now seen corresponding path program 1 times [2019-09-08 12:56:14,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:14,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:14,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:15,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:15,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:15,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:15,116 INFO L87 Difference]: Start difference. First operand 2710 states and 3849 transitions. Second operand 9 states. [2019-09-08 12:56:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:21,861 INFO L93 Difference]: Finished difference Result 4689 states and 6696 transitions. [2019-09-08 12:56:21,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:21,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:21,867 INFO L225 Difference]: With dead ends: 4689 [2019-09-08 12:56:21,867 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:56:21,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:56:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:56:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3848 transitions. [2019-09-08 12:56:22,192 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3848 transitions. Word has length 134 [2019-09-08 12:56:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:22,193 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3848 transitions. [2019-09-08 12:56:22,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3848 transitions. [2019-09-08 12:56:22,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:22,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:22,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:22,197 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:22,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:22,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1055577685, now seen corresponding path program 1 times [2019-09-08 12:56:22,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:22,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:22,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:22,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:22,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:22,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:22,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:22,403 INFO L87 Difference]: Start difference. First operand 2710 states and 3848 transitions. Second operand 9 states. [2019-09-08 12:56:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:28,759 INFO L93 Difference]: Finished difference Result 4584 states and 6517 transitions. [2019-09-08 12:56:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:28,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:28,765 INFO L225 Difference]: With dead ends: 4584 [2019-09-08 12:56:28,765 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:56:28,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:56:28,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:56:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:56:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3847 transitions. [2019-09-08 12:56:29,104 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3847 transitions. Word has length 134 [2019-09-08 12:56:29,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:29,104 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3847 transitions. [2019-09-08 12:56:29,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3847 transitions. [2019-09-08 12:56:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:29,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:29,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:29,109 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash -631298145, now seen corresponding path program 1 times [2019-09-08 12:56:29,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:29,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:29,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:29,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:29,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:29,359 INFO L87 Difference]: Start difference. First operand 2710 states and 3847 transitions. Second operand 9 states. [2019-09-08 12:56:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:35,942 INFO L93 Difference]: Finished difference Result 4784 states and 6826 transitions. [2019-09-08 12:56:35,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:35,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:35,947 INFO L225 Difference]: With dead ends: 4784 [2019-09-08 12:56:35,947 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:56:35,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:56:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:56:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3846 transitions. [2019-09-08 12:56:36,307 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3846 transitions. Word has length 134 [2019-09-08 12:56:36,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:36,308 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3846 transitions. [2019-09-08 12:56:36,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:36,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3846 transitions. [2019-09-08 12:56:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:36,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:36,311 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:36,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:36,311 INFO L82 PathProgramCache]: Analyzing trace with hash 899376670, now seen corresponding path program 1 times [2019-09-08 12:56:36,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:36,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:36,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:36,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:36,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:36,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:36,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:36,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:36,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:36,523 INFO L87 Difference]: Start difference. First operand 2710 states and 3846 transitions. Second operand 9 states. [2019-09-08 12:56:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:44,094 INFO L93 Difference]: Finished difference Result 4691 states and 6694 transitions. [2019-09-08 12:56:44,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:44,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:44,099 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 12:56:44,099 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:56:44,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:56:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:56:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3845 transitions. [2019-09-08 12:56:44,454 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3845 transitions. Word has length 134 [2019-09-08 12:56:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:44,455 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3845 transitions. [2019-09-08 12:56:44,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3845 transitions. [2019-09-08 12:56:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:44,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:44,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:44,457 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:44,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2060599935, now seen corresponding path program 1 times [2019-09-08 12:56:44,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:44,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:44,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:44,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 12:56:44,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:44,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:44,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:44,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:44,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:44,656 INFO L87 Difference]: Start difference. First operand 2710 states and 3845 transitions. Second operand 9 states. [2019-09-08 12:56:52,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:52,540 INFO L93 Difference]: Finished difference Result 4769 states and 6808 transitions. [2019-09-08 12:56:52,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:52,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:52,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:52,545 INFO L225 Difference]: With dead ends: 4769 [2019-09-08 12:56:52,545 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:56:52,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:56:52,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:56:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:56:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3844 transitions. [2019-09-08 12:56:52,921 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3844 transitions. Word has length 134 [2019-09-08 12:56:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:52,921 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3844 transitions. [2019-09-08 12:56:52,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3844 transitions. [2019-09-08 12:56:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:52,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:52,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:52,924 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1178386552, now seen corresponding path program 1 times [2019-09-08 12:56:52,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:52,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:52,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:56:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:56:53,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:56:53,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:56:53,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:56:53,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:56:53,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:56:53,121 INFO L87 Difference]: Start difference. First operand 2710 states and 3844 transitions. Second operand 9 states. [2019-09-08 12:56:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:56:59,541 INFO L93 Difference]: Finished difference Result 4588 states and 6516 transitions. [2019-09-08 12:56:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:56:59,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:56:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:56:59,546 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 12:56:59,547 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:56:59,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:56:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:56:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:56:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:56:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3843 transitions. [2019-09-08 12:56:59,932 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3843 transitions. Word has length 134 [2019-09-08 12:56:59,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:56:59,932 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3843 transitions. [2019-09-08 12:56:59,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:56:59,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3843 transitions. [2019-09-08 12:56:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:56:59,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:56:59,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:56:59,935 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:56:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:56:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1616019050, now seen corresponding path program 1 times [2019-09-08 12:56:59,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:56:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:56:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:59,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:56:59,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:56:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:00,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:00,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:00,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:00,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:00,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:00,139 INFO L87 Difference]: Start difference. First operand 2710 states and 3843 transitions. Second operand 9 states. [2019-09-08 12:57:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:07,741 INFO L93 Difference]: Finished difference Result 4691 states and 6690 transitions. [2019-09-08 12:57:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:07,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:57:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:07,746 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 12:57:07,747 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:57:07,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:57:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:57:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3842 transitions. [2019-09-08 12:57:08,169 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3842 transitions. Word has length 134 [2019-09-08 12:57:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:08,169 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3842 transitions. [2019-09-08 12:57:08,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3842 transitions. [2019-09-08 12:57:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 12:57:08,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:08,172 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:08,172 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:08,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:08,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1944837770, now seen corresponding path program 1 times [2019-09-08 12:57:08,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:08,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:08,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:08,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:08,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:08,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:08,364 INFO L87 Difference]: Start difference. First operand 2710 states and 3842 transitions. Second operand 9 states. [2019-09-08 12:57:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:15,997 INFO L93 Difference]: Finished difference Result 4691 states and 6689 transitions. [2019-09-08 12:57:15,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:15,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-08 12:57:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:16,005 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 12:57:16,005 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:57:16,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:57:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:57:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3841 transitions. [2019-09-08 12:57:16,442 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3841 transitions. Word has length 134 [2019-09-08 12:57:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:16,443 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3841 transitions. [2019-09-08 12:57:16,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3841 transitions. [2019-09-08 12:57:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:57:16,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:16,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:16,445 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:16,446 INFO L82 PathProgramCache]: Analyzing trace with hash 841035314, now seen corresponding path program 1 times [2019-09-08 12:57:16,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:16,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:16,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:16,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:16,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:16,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:16,652 INFO L87 Difference]: Start difference. First operand 2710 states and 3841 transitions. Second operand 9 states. [2019-09-08 12:57:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:24,196 INFO L93 Difference]: Finished difference Result 4684 states and 6677 transitions. [2019-09-08 12:57:24,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:24,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:57:24,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:24,202 INFO L225 Difference]: With dead ends: 4684 [2019-09-08 12:57:24,202 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:57:24,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:57:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:57:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3840 transitions. [2019-09-08 12:57:24,579 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3840 transitions. Word has length 135 [2019-09-08 12:57:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:24,579 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3840 transitions. [2019-09-08 12:57:24,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3840 transitions. [2019-09-08 12:57:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 12:57:24,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:24,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:24,582 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:24,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1755659690, now seen corresponding path program 1 times [2019-09-08 12:57:24,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:24,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:24,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:24,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:24,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:24,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:24,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:24,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:24,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:24,819 INFO L87 Difference]: Start difference. First operand 2710 states and 3840 transitions. Second operand 9 states. [2019-09-08 12:57:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:31,484 INFO L93 Difference]: Finished difference Result 4689 states and 6684 transitions. [2019-09-08 12:57:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:31,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-08 12:57:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:31,491 INFO L225 Difference]: With dead ends: 4689 [2019-09-08 12:57:31,491 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:57:31,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:57:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:57:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3839 transitions. [2019-09-08 12:57:31,868 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3839 transitions. Word has length 135 [2019-09-08 12:57:31,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:31,868 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3839 transitions. [2019-09-08 12:57:31,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3839 transitions. [2019-09-08 12:57:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:57:31,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:31,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:31,872 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:31,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1089607547, now seen corresponding path program 1 times [2019-09-08 12:57:31,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:31,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:31,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:32,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:32,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:32,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:32,084 INFO L87 Difference]: Start difference. First operand 2710 states and 3839 transitions. Second operand 9 states. [2019-09-08 12:57:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:38,904 INFO L93 Difference]: Finished difference Result 4850 states and 6903 transitions. [2019-09-08 12:57:38,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:38,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:57:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:38,910 INFO L225 Difference]: With dead ends: 4850 [2019-09-08 12:57:38,910 INFO L226 Difference]: Without dead ends: 4534 [2019-09-08 12:57:38,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4534 states. [2019-09-08 12:57:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4534 to 2710. [2019-09-08 12:57:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3837 transitions. [2019-09-08 12:57:39,286 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3837 transitions. Word has length 136 [2019-09-08 12:57:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:39,286 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3837 transitions. [2019-09-08 12:57:39,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3837 transitions. [2019-09-08 12:57:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:57:39,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:39,289 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2046822705, now seen corresponding path program 1 times [2019-09-08 12:57:39,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:39,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:39,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:39,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:39,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:39,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:39,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:39,530 INFO L87 Difference]: Start difference. First operand 2710 states and 3837 transitions. Second operand 9 states. [2019-09-08 12:57:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:46,647 INFO L93 Difference]: Finished difference Result 4598 states and 6522 transitions. [2019-09-08 12:57:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:46,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:57:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:46,653 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:57:46,653 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:57:46,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:46,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:57:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:57:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3835 transitions. [2019-09-08 12:57:47,063 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3835 transitions. Word has length 136 [2019-09-08 12:57:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:47,063 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3835 transitions. [2019-09-08 12:57:47,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3835 transitions. [2019-09-08 12:57:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:57:47,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:47,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:47,067 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:47,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash 189537334, now seen corresponding path program 1 times [2019-09-08 12:57:47,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:47,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:47,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:47,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:47,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:47,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:47,265 INFO L87 Difference]: Start difference. First operand 2710 states and 3835 transitions. Second operand 9 states. [2019-09-08 12:57:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:57:55,147 INFO L93 Difference]: Finished difference Result 4728 states and 6728 transitions. [2019-09-08 12:57:55,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:57:55,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:57:55,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:57:55,153 INFO L225 Difference]: With dead ends: 4728 [2019-09-08 12:57:55,153 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:57:55,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:57:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:57:55,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:57:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:57:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3833 transitions. [2019-09-08 12:57:55,543 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3833 transitions. Word has length 136 [2019-09-08 12:57:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:57:55,543 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3833 transitions. [2019-09-08 12:57:55,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:57:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3833 transitions. [2019-09-08 12:57:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:57:55,545 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:57:55,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:57:55,546 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:57:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:57:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1290920479, now seen corresponding path program 1 times [2019-09-08 12:57:55,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:57:55,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:57:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:55,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:57:55,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:57:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:57:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:57:55,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:57:55,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:57:55,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:57:55,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:57:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:57:55,754 INFO L87 Difference]: Start difference. First operand 2710 states and 3833 transitions. Second operand 9 states. [2019-09-08 12:58:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:02,281 INFO L93 Difference]: Finished difference Result 4598 states and 6518 transitions. [2019-09-08 12:58:02,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:02,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:02,287 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:58:02,287 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:02,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:58:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3831 transitions. [2019-09-08 12:58:02,682 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3831 transitions. Word has length 136 [2019-09-08 12:58:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:02,682 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3831 transitions. [2019-09-08 12:58:02,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3831 transitions. [2019-09-08 12:58:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:02,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:02,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:02,685 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:02,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:02,685 INFO L82 PathProgramCache]: Analyzing trace with hash -767686778, now seen corresponding path program 1 times [2019-09-08 12:58:02,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:02,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:02,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:02,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:02,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:02,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:02,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:02,932 INFO L87 Difference]: Start difference. First operand 2710 states and 3831 transitions. Second operand 9 states. [2019-09-08 12:58:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:09,832 INFO L93 Difference]: Finished difference Result 4728 states and 6722 transitions. [2019-09-08 12:58:09,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:09,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:09,837 INFO L225 Difference]: With dead ends: 4728 [2019-09-08 12:58:09,837 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:58:09,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:58:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:58:10,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:58:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3829 transitions. [2019-09-08 12:58:10,307 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3829 transitions. Word has length 136 [2019-09-08 12:58:10,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:10,308 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3829 transitions. [2019-09-08 12:58:10,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3829 transitions. [2019-09-08 12:58:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:10,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:10,310 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:10,311 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -766294188, now seen corresponding path program 1 times [2019-09-08 12:58:10,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:10,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:10,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:10,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:10,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:10,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:10,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:10,518 INFO L87 Difference]: Start difference. First operand 2710 states and 3829 transitions. Second operand 9 states. [2019-09-08 12:58:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:17,959 INFO L93 Difference]: Finished difference Result 4592 states and 6507 transitions. [2019-09-08 12:58:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:17,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:17,965 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:58:17,965 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:17,966 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:58:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3827 transitions. [2019-09-08 12:58:18,374 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3827 transitions. Word has length 136 [2019-09-08 12:58:18,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:18,374 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3827 transitions. [2019-09-08 12:58:18,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3827 transitions. [2019-09-08 12:58:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:18,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:18,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:18,377 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -377682901, now seen corresponding path program 1 times [2019-09-08 12:58:18,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:18,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:18,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:18,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:18,624 INFO L87 Difference]: Start difference. First operand 2710 states and 3827 transitions. Second operand 9 states. [2019-09-08 12:58:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:25,934 INFO L93 Difference]: Finished difference Result 4598 states and 6512 transitions. [2019-09-08 12:58:25,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:25,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:25,939 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:58:25,939 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:25,940 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:58:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3825 transitions. [2019-09-08 12:58:26,416 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3825 transitions. Word has length 136 [2019-09-08 12:58:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:26,417 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3825 transitions. [2019-09-08 12:58:26,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3825 transitions. [2019-09-08 12:58:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:26,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:26,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:26,420 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:26,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash -144035146, now seen corresponding path program 1 times [2019-09-08 12:58:26,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:26,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:26,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:26,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:26,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:26,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:26,646 INFO L87 Difference]: Start difference. First operand 2710 states and 3825 transitions. Second operand 9 states. [2019-09-08 12:58:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:33,381 INFO L93 Difference]: Finished difference Result 4592 states and 6501 transitions. [2019-09-08 12:58:33,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:33,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:33,387 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:58:33,387 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:33,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:58:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3823 transitions. [2019-09-08 12:58:33,855 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3823 transitions. Word has length 136 [2019-09-08 12:58:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:33,855 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3823 transitions. [2019-09-08 12:58:33,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:33,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3823 transitions. [2019-09-08 12:58:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:33,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:33,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:33,858 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash 866292793, now seen corresponding path program 1 times [2019-09-08 12:58:33,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:33,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:33,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:33,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:34,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:34,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:34,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:34,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:34,050 INFO L87 Difference]: Start difference. First operand 2710 states and 3823 transitions. Second operand 9 states. [2019-09-08 12:58:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:41,408 INFO L93 Difference]: Finished difference Result 4592 states and 6497 transitions. [2019-09-08 12:58:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:41,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:41,413 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:58:41,413 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:41,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:58:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3821 transitions. [2019-09-08 12:58:41,833 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3821 transitions. Word has length 136 [2019-09-08 12:58:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:41,834 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3821 transitions. [2019-09-08 12:58:41,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3821 transitions. [2019-09-08 12:58:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:41,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:41,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:41,836 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:41,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:41,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1255552509, now seen corresponding path program 1 times [2019-09-08 12:58:41,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:41,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:41,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:41,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:42,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:42,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:42,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:42,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:42,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:42,072 INFO L87 Difference]: Start difference. First operand 2710 states and 3821 transitions. Second operand 9 states. [2019-09-08 12:58:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:49,445 INFO L93 Difference]: Finished difference Result 4598 states and 6502 transitions. [2019-09-08 12:58:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:49,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:49,450 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:58:49,450 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:49,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:58:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3819 transitions. [2019-09-08 12:58:49,869 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3819 transitions. Word has length 136 [2019-09-08 12:58:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:49,870 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3819 transitions. [2019-09-08 12:58:49,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:49,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3819 transitions. [2019-09-08 12:58:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:49,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:49,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:49,872 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash -945330430, now seen corresponding path program 1 times [2019-09-08 12:58:49,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:49,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:49,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:49,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:49,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:50,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:50,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:50,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:50,076 INFO L87 Difference]: Start difference. First operand 2710 states and 3819 transitions. Second operand 9 states. [2019-09-08 12:58:56,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:58:56,631 INFO L93 Difference]: Finished difference Result 4598 states and 6498 transitions. [2019-09-08 12:58:56,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:58:56,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:58:56,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:58:56,637 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:58:56,637 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:58:56,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 12:58:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:58:57,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:58:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:58:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3817 transitions. [2019-09-08 12:58:57,066 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3817 transitions. Word has length 136 [2019-09-08 12:58:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:58:57,066 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3817 transitions. [2019-09-08 12:58:57,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:58:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3817 transitions. [2019-09-08 12:58:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:58:57,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:58:57,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:58:57,069 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:58:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:58:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1291029609, now seen corresponding path program 1 times [2019-09-08 12:58:57,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:58:57,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:58:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:57,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:58:57,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:58:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:58:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:58:57,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:58:57,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:58:57,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:58:57,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:58:57,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:58:57,281 INFO L87 Difference]: Start difference. First operand 2710 states and 3817 transitions. Second operand 9 states. [2019-09-08 12:59:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:05,325 INFO L93 Difference]: Finished difference Result 4728 states and 6700 transitions. [2019-09-08 12:59:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:05,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:05,330 INFO L225 Difference]: With dead ends: 4728 [2019-09-08 12:59:05,331 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:59:05,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:05,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:59:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:59:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3815 transitions. [2019-09-08 12:59:05,785 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3815 transitions. Word has length 136 [2019-09-08 12:59:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:05,785 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3815 transitions. [2019-09-08 12:59:05,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3815 transitions. [2019-09-08 12:59:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:05,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:05,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:05,788 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1291977335, now seen corresponding path program 1 times [2019-09-08 12:59:05,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:05,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:05,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:06,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:06,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:06,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:06,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:06,008 INFO L87 Difference]: Start difference. First operand 2710 states and 3815 transitions. Second operand 9 states. [2019-09-08 12:59:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:13,314 INFO L93 Difference]: Finished difference Result 4592 states and 6487 transitions. [2019-09-08 12:59:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:13,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:13,320 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:59:13,320 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:59:13,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:59:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:59:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3813 transitions. [2019-09-08 12:59:13,765 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3813 transitions. Word has length 136 [2019-09-08 12:59:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:13,765 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3813 transitions. [2019-09-08 12:59:13,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3813 transitions. [2019-09-08 12:59:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:13,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:13,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:13,768 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1681033486, now seen corresponding path program 1 times [2019-09-08 12:59:13,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:13,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:13,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:13,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:13,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:13,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:13,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:13,975 INFO L87 Difference]: Start difference. First operand 2710 states and 3813 transitions. Second operand 9 states. [2019-09-08 12:59:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:21,261 INFO L93 Difference]: Finished difference Result 4598 states and 6492 transitions. [2019-09-08 12:59:21,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:21,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:21,267 INFO L225 Difference]: With dead ends: 4598 [2019-09-08 12:59:21,267 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:59:21,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:59:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:59:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3811 transitions. [2019-09-08 12:59:21,709 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3811 transitions. Word has length 136 [2019-09-08 12:59:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:21,709 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3811 transitions. [2019-09-08 12:59:21,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3811 transitions. [2019-09-08 12:59:21,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:21,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:21,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:21,711 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:21,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:21,712 INFO L82 PathProgramCache]: Analyzing trace with hash 252279948, now seen corresponding path program 1 times [2019-09-08 12:59:21,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:21,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:21,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 12:59:21,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:21,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:21,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:21,921 INFO L87 Difference]: Start difference. First operand 2710 states and 3811 transitions. Second operand 9 states. [2019-09-08 12:59:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:28,808 INFO L93 Difference]: Finished difference Result 4716 states and 6676 transitions. [2019-09-08 12:59:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:28,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:28,814 INFO L225 Difference]: With dead ends: 4716 [2019-09-08 12:59:28,814 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 12:59:28,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:28,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 12:59:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 12:59:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3809 transitions. [2019-09-08 12:59:29,269 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3809 transitions. Word has length 136 [2019-09-08 12:59:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:29,269 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3809 transitions. [2019-09-08 12:59:29,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3809 transitions. [2019-09-08 12:59:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:29,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:29,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:29,272 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -5220605, now seen corresponding path program 1 times [2019-09-08 12:59:29,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:29,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:29,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:29,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:29,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:29,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:29,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:29,479 INFO L87 Difference]: Start difference. First operand 2710 states and 3809 transitions. Second operand 9 states. [2019-09-08 12:59:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:36,789 INFO L93 Difference]: Finished difference Result 4592 states and 6479 transitions. [2019-09-08 12:59:36,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:36,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:36,794 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:59:36,794 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:59:36,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:59:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:59:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:37,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3807 transitions. [2019-09-08 12:59:37,246 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3807 transitions. Word has length 136 [2019-09-08 12:59:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:37,247 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3807 transitions. [2019-09-08 12:59:37,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3807 transitions. [2019-09-08 12:59:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:37,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:37,249 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:37,249 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:37,250 INFO L82 PathProgramCache]: Analyzing trace with hash -737303364, now seen corresponding path program 1 times [2019-09-08 12:59:37,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:37,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:37,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:37,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:37,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:37,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:37,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:37,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:37,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:37,440 INFO L87 Difference]: Start difference. First operand 2710 states and 3807 transitions. Second operand 9 states. [2019-09-08 12:59:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:44,996 INFO L93 Difference]: Finished difference Result 4588 states and 6473 transitions. [2019-09-08 12:59:44,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:44,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:45,003 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 12:59:45,003 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:59:45,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:59:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:59:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3805 transitions. [2019-09-08 12:59:45,470 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3805 transitions. Word has length 136 [2019-09-08 12:59:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:45,470 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3805 transitions. [2019-09-08 12:59:45,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3805 transitions. [2019-09-08 12:59:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:45,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:45,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:45,473 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:45,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1728053055, now seen corresponding path program 1 times [2019-09-08 12:59:45,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:45,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:45,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:45,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:45,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:45,676 INFO L87 Difference]: Start difference. First operand 2710 states and 3805 transitions. Second operand 9 states. [2019-09-08 12:59:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:59:53,105 INFO L93 Difference]: Finished difference Result 4592 states and 6475 transitions. [2019-09-08 12:59:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:59:53,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 12:59:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:59:53,111 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 12:59:53,111 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 12:59:53,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:59:53,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 12:59:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 12:59:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 12:59:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3803 transitions. [2019-09-08 12:59:53,572 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3803 transitions. Word has length 136 [2019-09-08 12:59:53,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:59:53,572 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3803 transitions. [2019-09-08 12:59:53,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:59:53,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3803 transitions. [2019-09-08 12:59:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 12:59:53,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:59:53,575 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:59:53,575 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:59:53,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:59:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash -822462431, now seen corresponding path program 1 times [2019-09-08 12:59:53,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:59:53,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:59:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:53,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:59:53,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:59:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:59:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:59:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:59:53,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:59:53,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:59:53,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:59:53,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:59:53,808 INFO L87 Difference]: Start difference. First operand 2710 states and 3803 transitions. Second operand 9 states. [2019-09-08 13:00:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:01,235 INFO L93 Difference]: Finished difference Result 4588 states and 6467 transitions. [2019-09-08 13:00:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:01,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:01,240 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 13:00:01,240 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:01,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:01,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:01,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3801 transitions. [2019-09-08 13:00:01,709 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3801 transitions. Word has length 136 [2019-09-08 13:00:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:01,710 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3801 transitions. [2019-09-08 13:00:01,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3801 transitions. [2019-09-08 13:00:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:01,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:01,712 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:01,712 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:01,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:01,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1503867412, now seen corresponding path program 1 times [2019-09-08 13:00:01,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:01,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:01,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:01,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:01,934 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 13:00:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:01,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:01,935 INFO L87 Difference]: Start difference. First operand 2710 states and 3801 transitions. Second operand 9 states. [2019-09-08 13:00:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:09,671 INFO L93 Difference]: Finished difference Result 4592 states and 6469 transitions. [2019-09-08 13:00:09,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:09,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:09,677 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 13:00:09,677 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:09,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3799 transitions. [2019-09-08 13:00:10,150 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3799 transitions. Word has length 136 [2019-09-08 13:00:10,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:10,150 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3799 transitions. [2019-09-08 13:00:10,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:10,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3799 transitions. [2019-09-08 13:00:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:10,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:10,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:10,153 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1792529197, now seen corresponding path program 1 times [2019-09-08 13:00:10,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:10,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:10,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:10,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:10,354 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 13:00:10,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:10,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:10,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:10,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:10,355 INFO L87 Difference]: Start difference. First operand 2710 states and 3799 transitions. Second operand 9 states. [2019-09-08 13:00:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:17,129 INFO L93 Difference]: Finished difference Result 4588 states and 6461 transitions. [2019-09-08 13:00:17,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:17,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:17,135 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 13:00:17,135 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:17,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:00:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3797 transitions. [2019-09-08 13:00:17,612 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3797 transitions. Word has length 136 [2019-09-08 13:00:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:17,612 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3797 transitions. [2019-09-08 13:00:17,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3797 transitions. [2019-09-08 13:00:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:17,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:17,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:17,615 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1429196231, now seen corresponding path program 1 times [2019-09-08 13:00:17,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:17,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:17,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:17,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:17,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:17,829 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 13:00:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:17,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:17,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:17,831 INFO L87 Difference]: Start difference. First operand 2710 states and 3797 transitions. Second operand 9 states. [2019-09-08 13:00:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:25,265 INFO L93 Difference]: Finished difference Result 4588 states and 6457 transitions. [2019-09-08 13:00:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:25,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:25,270 INFO L225 Difference]: With dead ends: 4588 [2019-09-08 13:00:25,270 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:25,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:25,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3795 transitions. [2019-09-08 13:00:25,758 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3795 transitions. Word has length 136 [2019-09-08 13:00:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:25,758 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3795 transitions. [2019-09-08 13:00:25,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3795 transitions. [2019-09-08 13:00:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:25,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:25,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:25,762 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1006491598, now seen corresponding path program 1 times [2019-09-08 13:00:25,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:25,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:25,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:25,967 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 13:00:25,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:25,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:25,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:25,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:25,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:25,968 INFO L87 Difference]: Start difference. First operand 2710 states and 3795 transitions. Second operand 9 states. [2019-09-08 13:00:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:33,099 INFO L93 Difference]: Finished difference Result 4592 states and 6459 transitions. [2019-09-08 13:00:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:33,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:33,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:33,104 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 13:00:33,104 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:33,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:33,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3793 transitions. [2019-09-08 13:00:33,607 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3793 transitions. Word has length 136 [2019-09-08 13:00:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:33,607 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3793 transitions. [2019-09-08 13:00:33,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:33,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3793 transitions. [2019-09-08 13:00:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:33,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:33,610 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:33,610 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash -469281509, now seen corresponding path program 1 times [2019-09-08 13:00:33,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:33,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:33,807 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 13:00:33,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:33,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:33,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:33,808 INFO L87 Difference]: Start difference. First operand 2710 states and 3793 transitions. Second operand 9 states. [2019-09-08 13:00:41,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:41,488 INFO L93 Difference]: Finished difference Result 4716 states and 6650 transitions. [2019-09-08 13:00:41,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:41,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:41,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:41,493 INFO L225 Difference]: With dead ends: 4716 [2019-09-08 13:00:41,494 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 13:00:41,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 13:00:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 13:00:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3791 transitions. [2019-09-08 13:00:41,986 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3791 transitions. Word has length 136 [2019-09-08 13:00:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:41,986 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3791 transitions. [2019-09-08 13:00:41,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3791 transitions. [2019-09-08 13:00:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:41,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:41,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:41,988 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash -726782062, now seen corresponding path program 1 times [2019-09-08 13:00:41,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:41,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:41,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:42,195 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 13:00:42,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:42,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:42,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:42,196 INFO L87 Difference]: Start difference. First operand 2710 states and 3791 transitions. Second operand 9 states. [2019-09-08 13:00:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:49,112 INFO L93 Difference]: Finished difference Result 4592 states and 6453 transitions. [2019-09-08 13:00:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:49,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:49,117 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 13:00:49,117 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:49,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:00:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:49,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3789 transitions. [2019-09-08 13:00:49,654 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3789 transitions. Word has length 136 [2019-09-08 13:00:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:49,655 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3789 transitions. [2019-09-08 13:00:49,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3789 transitions. [2019-09-08 13:00:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:49,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:49,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:49,658 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:49,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:49,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1928635381, now seen corresponding path program 1 times [2019-09-08 13:00:49,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:49,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:49,855 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 13:00:49,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:49,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:49,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:49,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:49,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:49,856 INFO L87 Difference]: Start difference. First operand 2710 states and 3789 transitions. Second operand 9 states. [2019-09-08 13:00:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:00:57,320 INFO L93 Difference]: Finished difference Result 4594 states and 6452 transitions. [2019-09-08 13:00:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:00:57,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:00:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:00:57,325 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 13:00:57,325 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:00:57,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:00:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:00:57,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:00:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:00:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3787 transitions. [2019-09-08 13:00:57,820 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3787 transitions. Word has length 136 [2019-09-08 13:00:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:00:57,821 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3787 transitions. [2019-09-08 13:00:57,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:00:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3787 transitions. [2019-09-08 13:00:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:00:57,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:00:57,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:00:57,823 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:00:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:00:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash 437154291, now seen corresponding path program 1 times [2019-09-08 13:00:57,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:00:57,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:00:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:57,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:00:57,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:00:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:00:58,026 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 13:00:58,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:00:58,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:00:58,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:00:58,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:00:58,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:00:58,028 INFO L87 Difference]: Start difference. First operand 2710 states and 3787 transitions. Second operand 9 states. [2019-09-08 13:01:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:06,135 INFO L93 Difference]: Finished difference Result 4592 states and 6447 transitions. [2019-09-08 13:01:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:06,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:06,139 INFO L225 Difference]: With dead ends: 4592 [2019-09-08 13:01:06,139 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:06,140 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:06,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3785 transitions. [2019-09-08 13:01:06,636 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3785 transitions. Word has length 136 [2019-09-08 13:01:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:06,636 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3785 transitions. [2019-09-08 13:01:06,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3785 transitions. [2019-09-08 13:01:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:06,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:06,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:06,639 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash 2140262471, now seen corresponding path program 1 times [2019-09-08 13:01:06,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:06,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:06,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:06,844 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 13:01:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:06,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:06,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:06,845 INFO L87 Difference]: Start difference. First operand 2710 states and 3785 transitions. Second operand 9 states. [2019-09-08 13:01:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:13,785 INFO L93 Difference]: Finished difference Result 4407 states and 6161 transitions. [2019-09-08 13:01:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:13,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:13,789 INFO L225 Difference]: With dead ends: 4407 [2019-09-08 13:01:13,789 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:13,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:01:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3783 transitions. [2019-09-08 13:01:14,317 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3783 transitions. Word has length 136 [2019-09-08 13:01:14,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:14,317 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3783 transitions. [2019-09-08 13:01:14,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3783 transitions. [2019-09-08 13:01:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:14,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:14,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:14,320 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:14,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1769656664, now seen corresponding path program 1 times [2019-09-08 13:01:14,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:14,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:14,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:14,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:14,510 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 13:01:14,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:14,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:14,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:14,511 INFO L87 Difference]: Start difference. First operand 2710 states and 3783 transitions. Second operand 9 states. [2019-09-08 13:01:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:22,290 INFO L93 Difference]: Finished difference Result 4716 states and 6629 transitions. [2019-09-08 13:01:22,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:22,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:22,295 INFO L225 Difference]: With dead ends: 4716 [2019-09-08 13:01:22,295 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 13:01:22,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 13:01:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 13:01:22,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3781 transitions. [2019-09-08 13:01:22,808 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3781 transitions. Word has length 136 [2019-09-08 13:01:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:22,808 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3781 transitions. [2019-09-08 13:01:22,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3781 transitions. [2019-09-08 13:01:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:22,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:22,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:22,811 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:22,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash -419637699, now seen corresponding path program 1 times [2019-09-08 13:01:22,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:22,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:23,009 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 13:01:23,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:23,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:23,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:23,010 INFO L87 Difference]: Start difference. First operand 2710 states and 3781 transitions. Second operand 9 states. [2019-09-08 13:01:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:30,469 INFO L93 Difference]: Finished difference Result 4594 states and 6440 transitions. [2019-09-08 13:01:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:30,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:30,474 INFO L225 Difference]: With dead ends: 4594 [2019-09-08 13:01:30,475 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:30,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3779 transitions. [2019-09-08 13:01:30,985 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3779 transitions. Word has length 136 [2019-09-08 13:01:30,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:30,985 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3779 transitions. [2019-09-08 13:01:30,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:30,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3779 transitions. [2019-09-08 13:01:30,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:30,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:30,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:30,988 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:30,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:30,988 INFO L82 PathProgramCache]: Analyzing trace with hash 102059815, now seen corresponding path program 1 times [2019-09-08 13:01:30,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:30,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:30,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:30,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:31,198 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 13:01:31,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:31,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:31,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:31,199 INFO L87 Difference]: Start difference. First operand 2710 states and 3779 transitions. Second operand 9 states. [2019-09-08 13:01:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:37,900 INFO L93 Difference]: Finished difference Result 4582 states and 6424 transitions. [2019-09-08 13:01:37,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:37,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:37,905 INFO L225 Difference]: With dead ends: 4582 [2019-09-08 13:01:37,905 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:37,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:01:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3778 transitions. [2019-09-08 13:01:38,486 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3778 transitions. Word has length 136 [2019-09-08 13:01:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:38,486 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3778 transitions. [2019-09-08 13:01:38,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3778 transitions. [2019-09-08 13:01:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:38,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:38,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:38,489 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:38,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:38,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1072126581, now seen corresponding path program 1 times [2019-09-08 13:01:38,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:38,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:38,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:38,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:38,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:38,687 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 13:01:38,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:38,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:38,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:38,689 INFO L87 Difference]: Start difference. First operand 2710 states and 3778 transitions. Second operand 9 states. [2019-09-08 13:01:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:46,363 INFO L93 Difference]: Finished difference Result 4582 states and 6422 transitions. [2019-09-08 13:01:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:46,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:46,370 INFO L225 Difference]: With dead ends: 4582 [2019-09-08 13:01:46,370 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:46,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:46,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:46,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3777 transitions. [2019-09-08 13:01:46,903 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3777 transitions. Word has length 136 [2019-09-08 13:01:46,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:46,903 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3777 transitions. [2019-09-08 13:01:46,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3777 transitions. [2019-09-08 13:01:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:46,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:46,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:46,906 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1001517814, now seen corresponding path program 1 times [2019-09-08 13:01:46,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:46,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:46,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:46,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:47,162 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 13:01:47,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:47,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:47,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:47,163 INFO L87 Difference]: Start difference. First operand 2710 states and 3777 transitions. Second operand 9 states. [2019-09-08 13:01:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:01:54,938 INFO L93 Difference]: Finished difference Result 4584 states and 6423 transitions. [2019-09-08 13:01:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:01:54,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:01:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:01:54,944 INFO L225 Difference]: With dead ends: 4584 [2019-09-08 13:01:54,944 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:01:54,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:01:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:01:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:01:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:01:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3776 transitions. [2019-09-08 13:01:55,497 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3776 transitions. Word has length 136 [2019-09-08 13:01:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:01:55,497 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3776 transitions. [2019-09-08 13:01:55,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:01:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3776 transitions. [2019-09-08 13:01:55,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:01:55,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:01:55,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:01:55,500 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:01:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:01:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 503595498, now seen corresponding path program 1 times [2019-09-08 13:01:55,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:01:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:01:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:55,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:01:55,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:01:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:01:55,703 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 13:01:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:01:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:01:55,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:01:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:01:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:01:55,704 INFO L87 Difference]: Start difference. First operand 2710 states and 3776 transitions. Second operand 9 states. [2019-09-08 13:02:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:02,807 INFO L93 Difference]: Finished difference Result 4582 states and 6419 transitions. [2019-09-08 13:02:02,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:02:02,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:02:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:02,813 INFO L225 Difference]: With dead ends: 4582 [2019-09-08 13:02:02,813 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:02:02,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-09-08 13:02:02,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:02:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:02:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:02:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3775 transitions. [2019-09-08 13:02:03,360 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3775 transitions. Word has length 136 [2019-09-08 13:02:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:03,360 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3775 transitions. [2019-09-08 13:02:03,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:02:03,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3775 transitions. [2019-09-08 13:02:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:02:03,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:03,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:03,363 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1596917454, now seen corresponding path program 1 times [2019-09-08 13:02:03,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:03,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:03,553 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 13:02:03,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:03,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:02:03,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:02:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:02:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:02:03,554 INFO L87 Difference]: Start difference. First operand 2710 states and 3775 transitions. Second operand 9 states. [2019-09-08 13:02:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:11,184 INFO L93 Difference]: Finished difference Result 4576 states and 6408 transitions. [2019-09-08 13:02:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:02:11,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:02:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:11,190 INFO L225 Difference]: With dead ends: 4576 [2019-09-08 13:02:11,190 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:02:11,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:02:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:02:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:02:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:02:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3774 transitions. [2019-09-08 13:02:11,740 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3774 transitions. Word has length 136 [2019-09-08 13:02:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:11,740 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3774 transitions. [2019-09-08 13:02:11,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:02:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3774 transitions. [2019-09-08 13:02:11,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:02:11,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:11,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:11,743 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:11,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1246650529, now seen corresponding path program 1 times [2019-09-08 13:02:11,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:11,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:11,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:11,951 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 13:02:11,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:11,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:02:11,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:02:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:02:11,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:02:11,952 INFO L87 Difference]: Start difference. First operand 2710 states and 3774 transitions. Second operand 9 states. [2019-09-08 13:02:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:20,008 INFO L93 Difference]: Finished difference Result 4691 states and 6586 transitions. [2019-09-08 13:02:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:02:20,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:02:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:20,014 INFO L225 Difference]: With dead ends: 4691 [2019-09-08 13:02:20,014 INFO L226 Difference]: Without dead ends: 4486 [2019-09-08 13:02:20,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:02:20,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-09-08 13:02:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 2710. [2019-09-08 13:02:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:02:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3773 transitions. [2019-09-08 13:02:20,589 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3773 transitions. Word has length 136 [2019-09-08 13:02:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:20,589 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3773 transitions. [2019-09-08 13:02:20,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:02:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3773 transitions. [2019-09-08 13:02:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:02:20,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:20,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:20,592 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 517884233, now seen corresponding path program 1 times [2019-09-08 13:02:20,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:20,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:20,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:02:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:02:20,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:02:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:02:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:02:20,807 INFO L87 Difference]: Start difference. First operand 2710 states and 3773 transitions. Second operand 9 states. [2019-09-08 13:02:28,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:28,145 INFO L93 Difference]: Finished difference Result 4582 states and 6415 transitions. [2019-09-08 13:02:28,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:02:28,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:02:28,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:28,151 INFO L225 Difference]: With dead ends: 4582 [2019-09-08 13:02:28,151 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:02:28,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:02:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:02:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:02:28,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:02:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3772 transitions. [2019-09-08 13:02:28,716 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3772 transitions. Word has length 136 [2019-09-08 13:02:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:28,716 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3772 transitions. [2019-09-08 13:02:28,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:02:28,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3772 transitions. [2019-09-08 13:02:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:02:28,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:28,718 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:28,719 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 392660378, now seen corresponding path program 1 times [2019-09-08 13:02:28,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:28,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:28,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:28,928 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 13:02:28,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:28,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:02:28,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:02:28,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:02:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:02:28,929 INFO L87 Difference]: Start difference. First operand 2710 states and 3772 transitions. Second operand 9 states. [2019-09-08 13:02:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:02:36,681 INFO L93 Difference]: Finished difference Result 4584 states and 6416 transitions. [2019-09-08 13:02:36,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 13:02:36,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-09-08 13:02:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:02:36,685 INFO L225 Difference]: With dead ends: 4584 [2019-09-08 13:02:36,686 INFO L226 Difference]: Without dead ends: 4390 [2019-09-08 13:02:36,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 13:02:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-09-08 13:02:37,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 2710. [2019-09-08 13:02:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-09-08 13:02:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3771 transitions. [2019-09-08 13:02:37,241 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3771 transitions. Word has length 136 [2019-09-08 13:02:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:02:37,241 INFO L475 AbstractCegarLoop]: Abstraction has 2710 states and 3771 transitions. [2019-09-08 13:02:37,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 13:02:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3771 transitions. [2019-09-08 13:02:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:02:37,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:02:37,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 13:02:37,244 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr22ASSERT_VIOLATIONERROR_FUNCTION, mainErr24ASSERT_VIOLATIONERROR_FUNCTION, mainErr32ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr29ASSERT_VIOLATIONERROR_FUNCTION, mainErr30ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr28ASSERT_VIOLATIONERROR_FUNCTION, mainErr27ASSERT_VIOLATIONERROR_FUNCTION, mainErr34ASSERT_VIOLATIONERROR_FUNCTION, mainErr35ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr26ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr33ASSERT_VIOLATIONERROR_FUNCTION, mainErr36ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr31ASSERT_VIOLATIONERROR_FUNCTION, mainErr23ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr25ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:02:37,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:02:37,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1970263496, now seen corresponding path program 1 times [2019-09-08 13:02:37,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:02:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:02:37,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:37,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:02:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:02:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:02:37,438 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 13:02:37,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:02:37,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 13:02:37,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 13:02:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 13:02:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:02:37,440 INFO L87 Difference]: Start difference. First operand 2710 states and 3771 transitions. Second operand 9 states.