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.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:28:01,550 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:28:01,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:28:01,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:28:01,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:28:01,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:28:01,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:28:01,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:28:01,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:28:01,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:28:01,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:28:01,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:28:01,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:28:01,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:28:01,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:28:01,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:28:01,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:28:01,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:28:01,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:28:01,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:28:01,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:28:01,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:28:01,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:28:01,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:28:01,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:28:01,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:28:01,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:28:01,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:28:01,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:28:01,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:28:01,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:28:01,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:28:01,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:28:01,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:28:01,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:28:01,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:28:01,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:28:01,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:28:01,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:28:01,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:28:01,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:28:01,600 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:28:01,614 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:28:01,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:28:01,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:28:01,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:28:01,616 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:28:01,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:28:01,616 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:28:01,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:28:01,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:28:01,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:28:01,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:28:01,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:28:01,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:28:01,618 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:28:01,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:28:01,618 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:28:01,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:28:01,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:28:01,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:28:01,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:28:01,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:28:01,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:28:01,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:28:01,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:28:01,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:28:01,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:28:01,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:28:01,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:28:01,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:28:01,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:28:01,662 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:28:01,665 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:28:01,667 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:28:01,667 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:28:01,668 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:28:01,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62eb8cb5/e79110246f4147c9b6ecf0653c73ec28/FLAG5c3f51023 [2019-09-08 12:28:02,606 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:28:02,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:28:02,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62eb8cb5/e79110246f4147c9b6ecf0653c73ec28/FLAG5c3f51023 [2019-09-08 12:28:03,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d62eb8cb5/e79110246f4147c9b6ecf0653c73ec28 [2019-09-08 12:28:03,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:28:03,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:28:03,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:03,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:28:03,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:28:03,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:03" (1/1) ... [2019-09-08 12:28:03,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2264a4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:03, skipping insertion in model container [2019-09-08 12:28:03,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:03" (1/1) ... [2019-09-08 12:28:03,100 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:28:03,340 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:28:05,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:05,333 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:28:06,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:06,380 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:28:06,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06 WrapperNode [2019-09-08 12:28:06,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:06,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:28:06,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:28:06,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:28:06,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (1/1) ... [2019-09-08 12:28:06,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:28:06,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:28:06,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:28:06,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:28:06,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (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:28:06,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:28:06,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:28:06,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:28:06,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:28:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:28:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:28:06,802 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:28:06,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:28:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:28:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:28:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:28:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:28:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:28:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:28:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:28:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:28:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:28:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:28:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:28:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:28:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:28:13,814 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:28:13,815 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:28:13,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:13 BoogieIcfgContainer [2019-09-08 12:28:13,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:28:13,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:28:13,821 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:28:13,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:28:13,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:28:03" (1/3) ... [2019-09-08 12:28:13,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0f5698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:13, skipping insertion in model container [2019-09-08 12:28:13,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:06" (2/3) ... [2019-09-08 12:28:13,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0f5698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:13, skipping insertion in model container [2019-09-08 12:28:13,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:13" (3/3) ... [2019-09-08 12:28:13,833 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2019-09-08 12:28:13,842 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:28:13,852 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-08 12:28:13,868 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-08 12:28:13,919 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:28:13,920 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:28:13,920 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:28:13,920 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:28:13,920 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:28:13,920 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:28:13,921 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:28:13,921 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:28:13,921 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:28:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states. [2019-09-08 12:28:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:28:14,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:14,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:14,018 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1776998407, now seen corresponding path program 1 times [2019-09-08 12:28:14,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:14,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:14,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:14,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:14,899 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:28:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:14,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:14,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:14,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:14,924 INFO L87 Difference]: Start difference. First operand 2546 states. Second operand 5 states. [2019-09-08 12:28:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:17,419 INFO L93 Difference]: Finished difference Result 3325 states and 5692 transitions. [2019-09-08 12:28:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:17,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:28:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:17,453 INFO L225 Difference]: With dead ends: 3325 [2019-09-08 12:28:17,454 INFO L226 Difference]: Without dead ends: 2049 [2019-09-08 12:28:17,464 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:28:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-09-08 12:28:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2049. [2019-09-08 12:28:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2049 states. [2019-09-08 12:28:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2049 states to 2049 states and 2637 transitions. [2019-09-08 12:28:17,634 INFO L78 Accepts]: Start accepts. Automaton has 2049 states and 2637 transitions. Word has length 91 [2019-09-08 12:28:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:17,635 INFO L475 AbstractCegarLoop]: Abstraction has 2049 states and 2637 transitions. [2019-09-08 12:28:17,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2049 states and 2637 transitions. [2019-09-08 12:28:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:28:17,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:17,644 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:17,645 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 303122164, now seen corresponding path program 1 times [2019-09-08 12:28:17,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:17,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:17,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:17,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:17,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:17,948 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:28:17,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:17,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:17,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:17,951 INFO L87 Difference]: Start difference. First operand 2049 states and 2637 transitions. Second operand 5 states. [2019-09-08 12:28:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:20,006 INFO L93 Difference]: Finished difference Result 2673 states and 3436 transitions. [2019-09-08 12:28:20,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:20,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:28:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:20,016 INFO L225 Difference]: With dead ends: 2673 [2019-09-08 12:28:20,016 INFO L226 Difference]: Without dead ends: 1660 [2019-09-08 12:28:20,020 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:28:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-09-08 12:28:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2019-09-08 12:28:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-09-08 12:28:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2159 transitions. [2019-09-08 12:28:20,084 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2159 transitions. Word has length 91 [2019-09-08 12:28:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:20,085 INFO L475 AbstractCegarLoop]: Abstraction has 1660 states and 2159 transitions. [2019-09-08 12:28:20,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2159 transitions. [2019-09-08 12:28:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 12:28:20,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:20,090 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] [2019-09-08 12:28:20,091 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:20,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1974545675, now seen corresponding path program 1 times [2019-09-08 12:28:20,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:20,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:20,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:20,321 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:28:20,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:20,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:20,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:20,323 INFO L87 Difference]: Start difference. First operand 1660 states and 2159 transitions. Second operand 5 states. [2019-09-08 12:28:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:21,519 INFO L93 Difference]: Finished difference Result 1996 states and 2573 transitions. [2019-09-08 12:28:21,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:21,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-08 12:28:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:21,528 INFO L225 Difference]: With dead ends: 1996 [2019-09-08 12:28:21,529 INFO L226 Difference]: Without dead ends: 1182 [2019-09-08 12:28:21,531 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:28:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-09-08 12:28:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2019-09-08 12:28:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-09-08 12:28:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1540 transitions. [2019-09-08 12:28:21,597 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1540 transitions. Word has length 91 [2019-09-08 12:28:21,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:21,598 INFO L475 AbstractCegarLoop]: Abstraction has 1182 states and 1540 transitions. [2019-09-08 12:28:21,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1540 transitions. [2019-09-08 12:28:21,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 12:28:21,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:21,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] [2019-09-08 12:28:21,605 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:21,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:21,605 INFO L82 PathProgramCache]: Analyzing trace with hash -920384266, now seen corresponding path program 1 times [2019-09-08 12:28:21,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:21,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:21,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:21,923 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:28:21,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:21,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:21,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:21,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:21,926 INFO L87 Difference]: Start difference. First operand 1182 states and 1540 transitions. Second operand 5 states. [2019-09-08 12:28:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:22,899 INFO L93 Difference]: Finished difference Result 1372 states and 1759 transitions. [2019-09-08 12:28:22,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:22,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 12:28:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:22,904 INFO L225 Difference]: With dead ends: 1372 [2019-09-08 12:28:22,904 INFO L226 Difference]: Without dead ends: 802 [2019-09-08 12:28:22,906 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:28:22,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-08 12:28:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2019-09-08 12:28:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-09-08 12:28:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1041 transitions. [2019-09-08 12:28:22,946 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1041 transitions. Word has length 93 [2019-09-08 12:28:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:22,946 INFO L475 AbstractCegarLoop]: Abstraction has 802 states and 1041 transitions. [2019-09-08 12:28:22,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1041 transitions. [2019-09-08 12:28:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 12:28:22,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:22,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] [2019-09-08 12:28:22,950 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:22,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1089233402, now seen corresponding path program 1 times [2019-09-08 12:28:22,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:22,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:22,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:23,169 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:28:23,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:23,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:23,172 INFO L87 Difference]: Start difference. First operand 802 states and 1041 transitions. Second operand 5 states. [2019-09-08 12:28:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:23,800 INFO L93 Difference]: Finished difference Result 1138 states and 1477 transitions. [2019-09-08 12:28:23,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:23,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 12:28:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:23,805 INFO L225 Difference]: With dead ends: 1138 [2019-09-08 12:28:23,805 INFO L226 Difference]: Without dead ends: 714 [2019-09-08 12:28:23,806 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:28:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-08 12:28:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-09-08 12:28:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-09-08 12:28:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 929 transitions. [2019-09-08 12:28:23,840 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 929 transitions. Word has length 95 [2019-09-08 12:28:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:23,840 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 929 transitions. [2019-09-08 12:28:23,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 929 transitions. [2019-09-08 12:28:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 12:28:23,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:23,843 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] [2019-09-08 12:28:23,844 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:23,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash -414406108, now seen corresponding path program 1 times [2019-09-08 12:28:23,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:23,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:23,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:23,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:24,059 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:28:24,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:24,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:24,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:24,061 INFO L87 Difference]: Start difference. First operand 714 states and 929 transitions. Second operand 5 states. [2019-09-08 12:28:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:24,852 INFO L93 Difference]: Finished difference Result 1092 states and 1427 transitions. [2019-09-08 12:28:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:24,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 12:28:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:24,857 INFO L225 Difference]: With dead ends: 1092 [2019-09-08 12:28:24,858 INFO L226 Difference]: Without dead ends: 706 [2019-09-08 12:28:24,859 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:28:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-09-08 12:28:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2019-09-08 12:28:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 919 transitions. [2019-09-08 12:28:24,896 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 919 transitions. Word has length 97 [2019-09-08 12:28:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:24,896 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 919 transitions. [2019-09-08 12:28:24,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 919 transitions. [2019-09-08 12:28:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:28:24,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:24,899 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] [2019-09-08 12:28:24,900 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash -358667265, now seen corresponding path program 1 times [2019-09-08 12:28:24,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:24,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:24,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:25,313 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:28:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:25,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:28:25,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:28:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:28:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:28:25,315 INFO L87 Difference]: Start difference. First operand 706 states and 919 transitions. Second operand 8 states. [2019-09-08 12:28:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:26,772 INFO L93 Difference]: Finished difference Result 1334 states and 1692 transitions. [2019-09-08 12:28:26,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:28:26,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-09-08 12:28:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:26,778 INFO L225 Difference]: With dead ends: 1334 [2019-09-08 12:28:26,778 INFO L226 Difference]: Without dead ends: 955 [2019-09-08 12:28:26,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:28:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-09-08 12:28:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 706. [2019-09-08 12:28:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-09-08 12:28:26,830 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 99 [2019-09-08 12:28:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:26,831 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-09-08 12:28:26,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:28:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-09-08 12:28:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:28:26,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:26,837 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] [2019-09-08 12:28:26,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1672611521, now seen corresponding path program 1 times [2019-09-08 12:28:26,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:27,150 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:28:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:27,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:27,152 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 9 states. [2019-09-08 12:28:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:29,362 INFO L93 Difference]: Finished difference Result 1332 states and 1767 transitions. [2019-09-08 12:28:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:29,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:28:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:29,374 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 12:28:29,375 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:29,376 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:28:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:29,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 917 transitions. [2019-09-08 12:28:29,488 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 917 transitions. Word has length 99 [2019-09-08 12:28:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:29,491 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 917 transitions. [2019-09-08 12:28:29,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:29,492 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 917 transitions. [2019-09-08 12:28:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 12:28:29,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:29,498 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] [2019-09-08 12:28:29,499 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1607232673, now seen corresponding path program 1 times [2019-09-08 12:28:29,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:29,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:29,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:30,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:28:30,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:30,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:30,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:30,008 INFO L87 Difference]: Start difference. First operand 706 states and 917 transitions. Second operand 9 states. [2019-09-08 12:28:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:32,125 INFO L93 Difference]: Finished difference Result 1449 states and 1928 transitions. [2019-09-08 12:28:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:32,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-08 12:28:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:32,132 INFO L225 Difference]: With dead ends: 1449 [2019-09-08 12:28:32,132 INFO L226 Difference]: Without dead ends: 1240 [2019-09-08 12:28:32,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:32,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-08 12:28:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 706. [2019-09-08 12:28:32,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 916 transitions. [2019-09-08 12:28:32,187 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 916 transitions. Word has length 99 [2019-09-08 12:28:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:32,188 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 916 transitions. [2019-09-08 12:28:32,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 916 transitions. [2019-09-08 12:28:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:32,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:32,190 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] [2019-09-08 12:28:32,191 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash -45829627, now seen corresponding path program 1 times [2019-09-08 12:28:32,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:32,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:32,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:32,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:28:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:32,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:32,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:32,530 INFO L87 Difference]: Start difference. First operand 706 states and 916 transitions. Second operand 9 states. [2019-09-08 12:28:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:34,530 INFO L93 Difference]: Finished difference Result 1327 states and 1760 transitions. [2019-09-08 12:28:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:34,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:34,536 INFO L225 Difference]: With dead ends: 1327 [2019-09-08 12:28:34,536 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:34,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:34,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 915 transitions. [2019-09-08 12:28:34,612 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 915 transitions. Word has length 100 [2019-09-08 12:28:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:34,612 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 915 transitions. [2019-09-08 12:28:34,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 915 transitions. [2019-09-08 12:28:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 12:28:34,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:34,616 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] [2019-09-08 12:28:34,617 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1007680891, now seen corresponding path program 1 times [2019-09-08 12:28:34,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:34,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:34,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:34,970 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:28:34,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:34,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:34,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:34,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:34,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:34,972 INFO L87 Difference]: Start difference. First operand 706 states and 915 transitions. Second operand 9 states. [2019-09-08 12:28:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:37,401 INFO L93 Difference]: Finished difference Result 1368 states and 1821 transitions. [2019-09-08 12:28:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:37,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-08 12:28:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:37,410 INFO L225 Difference]: With dead ends: 1368 [2019-09-08 12:28:37,410 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 12:28:37,411 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:28:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 12:28:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-08 12:28:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 914 transitions. [2019-09-08 12:28:37,466 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 914 transitions. Word has length 100 [2019-09-08 12:28:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:37,467 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 914 transitions. [2019-09-08 12:28:37,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 914 transitions. [2019-09-08 12:28:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:37,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:37,470 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] [2019-09-08 12:28:37,470 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:37,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1056417724, now seen corresponding path program 1 times [2019-09-08 12:28:37,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:37,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:37,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:37,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:37,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:37,784 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:28:37,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:37,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:37,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:37,787 INFO L87 Difference]: Start difference. First operand 706 states and 914 transitions. Second operand 9 states. [2019-09-08 12:28:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:39,809 INFO L93 Difference]: Finished difference Result 1341 states and 1769 transitions. [2019-09-08 12:28:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:39,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:39,816 INFO L225 Difference]: With dead ends: 1341 [2019-09-08 12:28:39,817 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:39,818 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:28:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:39,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 913 transitions. [2019-09-08 12:28:39,876 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 913 transitions. Word has length 101 [2019-09-08 12:28:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:39,876 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 913 transitions. [2019-09-08 12:28:39,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:39,877 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 913 transitions. [2019-09-08 12:28:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:39,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:39,879 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] [2019-09-08 12:28:39,880 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:39,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -434839516, now seen corresponding path program 1 times [2019-09-08 12:28:39,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:39,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:40,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:28:40,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:40,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:40,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:40,143 INFO L87 Difference]: Start difference. First operand 706 states and 913 transitions. Second operand 9 states. [2019-09-08 12:28:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:42,478 INFO L93 Difference]: Finished difference Result 1382 states and 1830 transitions. [2019-09-08 12:28:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:42,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:42,485 INFO L225 Difference]: With dead ends: 1382 [2019-09-08 12:28:42,485 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 12:28:42,486 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:28:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 12:28:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-08 12:28:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:42,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 912 transitions. [2019-09-08 12:28:42,545 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 912 transitions. Word has length 101 [2019-09-08 12:28:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:42,546 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 912 transitions. [2019-09-08 12:28:42,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 912 transitions. [2019-09-08 12:28:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:42,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:42,548 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] [2019-09-08 12:28:42,549 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:42,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:42,549 INFO L82 PathProgramCache]: Analyzing trace with hash -674178492, now seen corresponding path program 1 times [2019-09-08 12:28:42,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:42,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:42,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:42,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:42,798 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:28:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:42,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:42,800 INFO L87 Difference]: Start difference. First operand 706 states and 912 transitions. Second operand 9 states. [2019-09-08 12:28:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:44,869 INFO L93 Difference]: Finished difference Result 1332 states and 1759 transitions. [2019-09-08 12:28:44,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:44,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:44,875 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 12:28:44,875 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:44,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:44,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 911 transitions. [2019-09-08 12:28:44,940 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 911 transitions. Word has length 101 [2019-09-08 12:28:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:44,940 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 911 transitions. [2019-09-08 12:28:44,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 911 transitions. [2019-09-08 12:28:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:44,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:44,943 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] [2019-09-08 12:28:44,943 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1611690492, now seen corresponding path program 1 times [2019-09-08 12:28:44,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:44,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:44,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:44,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:44,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:45,256 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:28:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:45,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:45,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:45,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:45,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:45,258 INFO L87 Difference]: Start difference. First operand 706 states and 911 transitions. Second operand 9 states. [2019-09-08 12:28:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:47,358 INFO L93 Difference]: Finished difference Result 1479 states and 1946 transitions. [2019-09-08 12:28:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:47,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:47,363 INFO L225 Difference]: With dead ends: 1479 [2019-09-08 12:28:47,363 INFO L226 Difference]: Without dead ends: 1240 [2019-09-08 12:28:47,365 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:28:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2019-09-08 12:28:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 706. [2019-09-08 12:28:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 910 transitions. [2019-09-08 12:28:47,428 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 910 transitions. Word has length 101 [2019-09-08 12:28:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:47,428 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 910 transitions. [2019-09-08 12:28:47,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 910 transitions. [2019-09-08 12:28:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:47,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:47,431 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] [2019-09-08 12:28:47,432 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:47,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1392154140, now seen corresponding path program 1 times [2019-09-08 12:28:47,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:47,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:47,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:47,681 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:28:47,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:47,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:47,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:47,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:47,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:47,683 INFO L87 Difference]: Start difference. First operand 706 states and 910 transitions. Second operand 9 states. [2019-09-08 12:28:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:49,792 INFO L93 Difference]: Finished difference Result 1332 states and 1758 transitions. [2019-09-08 12:28:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:49,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:49,798 INFO L225 Difference]: With dead ends: 1332 [2019-09-08 12:28:49,798 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:49,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:28:49,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 909 transitions. [2019-09-08 12:28:49,864 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 909 transitions. Word has length 101 [2019-09-08 12:28:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:49,865 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 909 transitions. [2019-09-08 12:28:49,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 909 transitions. [2019-09-08 12:28:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:49,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:49,867 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] [2019-09-08 12:28:49,868 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 277444804, now seen corresponding path program 1 times [2019-09-08 12:28:49,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:50,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:28:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:50,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:50,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:50,134 INFO L87 Difference]: Start difference. First operand 706 states and 909 transitions. Second operand 9 states. [2019-09-08 12:28:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,060 INFO L93 Difference]: Finished difference Result 1261 states and 1643 transitions. [2019-09-08 12:28:52,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:52,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,064 INFO L225 Difference]: With dead ends: 1261 [2019-09-08 12:28:52,065 INFO L226 Difference]: Without dead ends: 1180 [2019-09-08 12:28:52,066 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:28:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-08 12:28:52,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-08 12:28:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:52,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 908 transitions. [2019-09-08 12:28:52,157 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 908 transitions. Word has length 101 [2019-09-08 12:28:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,158 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 908 transitions. [2019-09-08 12:28:52,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:52,158 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 908 transitions. [2019-09-08 12:28:52,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:52,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,161 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] [2019-09-08 12:28:52,166 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1790777636, now seen corresponding path program 1 times [2019-09-08 12:28:52,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,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:28:52,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:52,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:52,403 INFO L87 Difference]: Start difference. First operand 706 states and 908 transitions. Second operand 9 states. [2019-09-08 12:28:54,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:54,628 INFO L93 Difference]: Finished difference Result 1341 states and 1763 transitions. [2019-09-08 12:28:54,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:54,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:54,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:54,633 INFO L225 Difference]: With dead ends: 1341 [2019-09-08 12:28:54,634 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:28:54,634 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:28:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:28:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:28:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 907 transitions. [2019-09-08 12:28:54,688 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 907 transitions. Word has length 101 [2019-09-08 12:28:54,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:54,688 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 907 transitions. [2019-09-08 12:28:54,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 907 transitions. [2019-09-08 12:28:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 12:28:54,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:54,690 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] [2019-09-08 12:28:54,690 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:54,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1914839865, now seen corresponding path program 1 times [2019-09-08 12:28:54,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:54,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:54,957 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:28:54,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:54,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:54,960 INFO L87 Difference]: Start difference. First operand 706 states and 907 transitions. Second operand 9 states. [2019-09-08 12:28:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:57,089 INFO L93 Difference]: Finished difference Result 1296 states and 1703 transitions. [2019-09-08 12:28:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:57,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 101 [2019-09-08 12:28:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:57,096 INFO L225 Difference]: With dead ends: 1296 [2019-09-08 12:28:57,096 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:28:57,096 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:28:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:28:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:28:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 906 transitions. [2019-09-08 12:28:57,156 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 906 transitions. Word has length 101 [2019-09-08 12:28:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:57,157 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 906 transitions. [2019-09-08 12:28:57,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 906 transitions. [2019-09-08 12:28:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:57,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:57,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] [2019-09-08 12:28:57,159 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1049586336, now seen corresponding path program 1 times [2019-09-08 12:28:57,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:57,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:57,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:57,418 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:28:57,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:57,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:57,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:57,420 INFO L87 Difference]: Start difference. First operand 706 states and 906 transitions. Second operand 9 states. [2019-09-08 12:28:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:59,541 INFO L93 Difference]: Finished difference Result 1297 states and 1703 transitions. [2019-09-08 12:28:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:28:59,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:28:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:59,546 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 12:28:59,546 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:28:59,547 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:28:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:28:59,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:28:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:28:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 905 transitions. [2019-09-08 12:28:59,599 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 905 transitions. Word has length 102 [2019-09-08 12:28:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:59,599 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 905 transitions. [2019-09-08 12:28:59,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:28:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 905 transitions. [2019-09-08 12:28:59,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:28:59,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:59,601 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] [2019-09-08 12:28:59,601 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:59,602 INFO L82 PathProgramCache]: Analyzing trace with hash -474327840, now seen corresponding path program 1 times [2019-09-08 12:28:59,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:59,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:59,938 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:28:59,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:59,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:28:59,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:28:59,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:28:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:28:59,940 INFO L87 Difference]: Start difference. First operand 706 states and 905 transitions. Second operand 9 states. [2019-09-08 12:29:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:02,029 INFO L93 Difference]: Finished difference Result 1297 states and 1702 transitions. [2019-09-08 12:29:02,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:02,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:02,036 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 12:29:02,036 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:02,037 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:29:02,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 904 transitions. [2019-09-08 12:29:02,089 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 904 transitions. Word has length 102 [2019-09-08 12:29:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:02,089 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 904 transitions. [2019-09-08 12:29:02,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 904 transitions. [2019-09-08 12:29:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:02,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:02,091 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] [2019-09-08 12:29:02,092 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash 540545664, now seen corresponding path program 1 times [2019-09-08 12:29:02,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:02,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:02,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:02,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:02,329 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:29:02,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:02,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:02,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:02,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:02,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:02,330 INFO L87 Difference]: Start difference. First operand 706 states and 904 transitions. Second operand 9 states. [2019-09-08 12:29:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:04,343 INFO L93 Difference]: Finished difference Result 1301 states and 1704 transitions. [2019-09-08 12:29:04,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:04,346 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:04,352 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 12:29:04,352 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:04,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:29:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 903 transitions. [2019-09-08 12:29:04,406 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 903 transitions. Word has length 102 [2019-09-08 12:29:04,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:04,406 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 903 transitions. [2019-09-08 12:29:04,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:04,406 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 903 transitions. [2019-09-08 12:29:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:04,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:04,408 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] [2019-09-08 12:29:04,408 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash -362046912, now seen corresponding path program 1 times [2019-09-08 12:29:04,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:04,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:04,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:29:04,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:04,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:04,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:04,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:04,656 INFO L87 Difference]: Start difference. First operand 706 states and 903 transitions. Second operand 9 states. [2019-09-08 12:29:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:06,730 INFO L93 Difference]: Finished difference Result 1258 states and 1633 transitions. [2019-09-08 12:29:06,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:06,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:06,737 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 12:29:06,737 INFO L226 Difference]: Without dead ends: 1180 [2019-09-08 12:29:06,738 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:29:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-08 12:29:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-08 12:29:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 902 transitions. [2019-09-08 12:29:06,817 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 902 transitions. Word has length 102 [2019-09-08 12:29:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:06,818 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 902 transitions. [2019-09-08 12:29:06,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 902 transitions. [2019-09-08 12:29:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:06,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:06,819 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] [2019-09-08 12:29:06,819 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1954183776, now seen corresponding path program 1 times [2019-09-08 12:29:06,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:06,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:07,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:07,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:07,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:07,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:07,048 INFO L87 Difference]: Start difference. First operand 706 states and 902 transitions. Second operand 9 states. [2019-09-08 12:29:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:09,254 INFO L93 Difference]: Finished difference Result 1297 states and 1699 transitions. [2019-09-08 12:29:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:09,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:09,260 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 12:29:09,260 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:09,261 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:29:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 901 transitions. [2019-09-08 12:29:09,334 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 901 transitions. Word has length 102 [2019-09-08 12:29:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:09,334 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 901 transitions. [2019-09-08 12:29:09,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 901 transitions. [2019-09-08 12:29:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:09,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:09,336 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] [2019-09-08 12:29:09,336 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:09,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1697282144, now seen corresponding path program 1 times [2019-09-08 12:29:09,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:09,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:09,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:09,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:09,570 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:29:09,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:09,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:09,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:09,571 INFO L87 Difference]: Start difference. First operand 706 states and 901 transitions. Second operand 9 states. [2019-09-08 12:29:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:12,071 INFO L93 Difference]: Finished difference Result 1297 states and 1698 transitions. [2019-09-08 12:29:12,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:12,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:12,076 INFO L225 Difference]: With dead ends: 1297 [2019-09-08 12:29:12,076 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:12,077 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:29:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 900 transitions. [2019-09-08 12:29:12,137 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 900 transitions. Word has length 102 [2019-09-08 12:29:12,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:12,138 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 900 transitions. [2019-09-08 12:29:12,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 900 transitions. [2019-09-08 12:29:12,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 12:29:12,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:12,139 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] [2019-09-08 12:29:12,139 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash 259593247, now seen corresponding path program 1 times [2019-09-08 12:29:12,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:12,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:12,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:12,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:12,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:12,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:12,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:12,411 INFO L87 Difference]: Start difference. First operand 706 states and 900 transitions. Second operand 9 states. [2019-09-08 12:29:14,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:14,714 INFO L93 Difference]: Finished difference Result 1256 states and 1628 transitions. [2019-09-08 12:29:14,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:14,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-08 12:29:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:14,718 INFO L225 Difference]: With dead ends: 1256 [2019-09-08 12:29:14,719 INFO L226 Difference]: Without dead ends: 1180 [2019-09-08 12:29:14,719 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:29:14,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-09-08 12:29:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 706. [2019-09-08 12:29:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 899 transitions. [2019-09-08 12:29:14,778 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 899 transitions. Word has length 102 [2019-09-08 12:29:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:14,778 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 899 transitions. [2019-09-08 12:29:14,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 899 transitions. [2019-09-08 12:29:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:14,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:14,780 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] [2019-09-08 12:29:14,780 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:14,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1176930359, now seen corresponding path program 1 times [2019-09-08 12:29:14,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:14,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:14,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:14,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:14,984 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:29:14,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:14,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:14,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:14,985 INFO L87 Difference]: Start difference. First operand 706 states and 899 transitions. Second operand 9 states. [2019-09-08 12:29:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:16,982 INFO L93 Difference]: Finished difference Result 1341 states and 1750 transitions. [2019-09-08 12:29:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:16,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:16,985 INFO L225 Difference]: With dead ends: 1341 [2019-09-08 12:29:16,985 INFO L226 Difference]: Without dead ends: 1228 [2019-09-08 12:29:16,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:29:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-09-08 12:29:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 706. [2019-09-08 12:29:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 898 transitions. [2019-09-08 12:29:17,048 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 898 transitions. Word has length 103 [2019-09-08 12:29:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:17,049 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 898 transitions. [2019-09-08 12:29:17,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 898 transitions. [2019-09-08 12:29:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:17,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:17,050 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] [2019-09-08 12:29:17,051 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 870365257, now seen corresponding path program 1 times [2019-09-08 12:29:17,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:17,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:17,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:17,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:17,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:17,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:17,255 INFO L87 Difference]: Start difference. First operand 706 states and 898 transitions. Second operand 9 states. [2019-09-08 12:29:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:19,540 INFO L93 Difference]: Finished difference Result 1301 states and 1698 transitions. [2019-09-08 12:29:19,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:19,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:19,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:19,543 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 12:29:19,543 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:19,544 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:29:19,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 897 transitions. [2019-09-08 12:29:19,607 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 897 transitions. Word has length 103 [2019-09-08 12:29:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:19,607 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 897 transitions. [2019-09-08 12:29:19,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 897 transitions. [2019-09-08 12:29:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:19,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:19,609 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] [2019-09-08 12:29:19,609 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash -516081623, now seen corresponding path program 1 times [2019-09-08 12:29:19,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:19,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:19,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:19,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:19,867 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:29:19,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:19,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:19,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:19,869 INFO L87 Difference]: Start difference. First operand 706 states and 897 transitions. Second operand 9 states. [2019-09-08 12:29:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:22,449 INFO L93 Difference]: Finished difference Result 1397 states and 1823 transitions. [2019-09-08 12:29:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:22,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:22,452 INFO L225 Difference]: With dead ends: 1397 [2019-09-08 12:29:22,452 INFO L226 Difference]: Without dead ends: 1235 [2019-09-08 12:29:22,454 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:29:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-09-08 12:29:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 706. [2019-09-08 12:29:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 896 transitions. [2019-09-08 12:29:22,564 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 896 transitions. Word has length 103 [2019-09-08 12:29:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:22,564 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 896 transitions. [2019-09-08 12:29:22,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 896 transitions. [2019-09-08 12:29:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:22,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:22,567 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] [2019-09-08 12:29:22,567 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -673803223, now seen corresponding path program 1 times [2019-09-08 12:29:22,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:22,796 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:29:22,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:22,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:22,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:22,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:22,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:22,798 INFO L87 Difference]: Start difference. First operand 706 states and 896 transitions. Second operand 9 states. [2019-09-08 12:29:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:24,907 INFO L93 Difference]: Finished difference Result 1301 states and 1695 transitions. [2019-09-08 12:29:24,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:24,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:24,911 INFO L225 Difference]: With dead ends: 1301 [2019-09-08 12:29:24,911 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 12:29:24,914 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:29:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 12:29:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 706. [2019-09-08 12:29:25,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-09-08 12:29:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 895 transitions. [2019-09-08 12:29:25,031 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 895 transitions. Word has length 103 [2019-09-08 12:29:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:25,032 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 895 transitions. [2019-09-08 12:29:25,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 895 transitions. [2019-09-08 12:29:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:25,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:25,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] [2019-09-08 12:29:25,034 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:25,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1113694153, now seen corresponding path program 1 times [2019-09-08 12:29:25,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:25,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:25,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:25,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:25,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:25,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:25,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:25,255 INFO L87 Difference]: Start difference. First operand 706 states and 895 transitions. Second operand 9 states. [2019-09-08 12:29:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:27,588 INFO L93 Difference]: Finished difference Result 1255 states and 1622 transitions. [2019-09-08 12:29:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:27,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:27,595 INFO L225 Difference]: With dead ends: 1255 [2019-09-08 12:29:27,595 INFO L226 Difference]: Without dead ends: 1179 [2019-09-08 12:29:27,596 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:29:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2019-09-08 12:29:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 705. [2019-09-08 12:29:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 12:29:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 893 transitions. [2019-09-08 12:29:27,704 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 893 transitions. Word has length 103 [2019-09-08 12:29:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:27,704 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 893 transitions. [2019-09-08 12:29:27,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 893 transitions. [2019-09-08 12:29:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:27,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:27,706 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] [2019-09-08 12:29:27,706 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1754695543, now seen corresponding path program 1 times [2019-09-08 12:29:27,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:27,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:27,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:27,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:27,900 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:29:27,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:27,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:27,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:27,902 INFO L87 Difference]: Start difference. First operand 705 states and 893 transitions. Second operand 9 states. [2019-09-08 12:29:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:30,224 INFO L93 Difference]: Finished difference Result 1300 states and 1692 transitions. [2019-09-08 12:29:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:30,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:30,230 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 12:29:30,230 INFO L226 Difference]: Without dead ends: 1211 [2019-09-08 12:29:30,231 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:29:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-08 12:29:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-08 12:29:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 12:29:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 892 transitions. [2019-09-08 12:29:30,381 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 892 transitions. Word has length 103 [2019-09-08 12:29:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:30,381 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 892 transitions. [2019-09-08 12:29:30,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 892 transitions. [2019-09-08 12:29:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:30,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:30,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:30,383 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1081765687, now seen corresponding path program 1 times [2019-09-08 12:29:30,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:30,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:30,583 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:29:30,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:30,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:30,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:30,587 INFO L87 Difference]: Start difference. First operand 705 states and 892 transitions. Second operand 9 states. [2019-09-08 12:29:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:33,217 INFO L93 Difference]: Finished difference Result 1300 states and 1691 transitions. [2019-09-08 12:29:33,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:33,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:33,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:33,220 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 12:29:33,220 INFO L226 Difference]: Without dead ends: 1211 [2019-09-08 12:29:33,221 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:29:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-08 12:29:33,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-08 12:29:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 12:29:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 891 transitions. [2019-09-08 12:29:33,347 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 891 transitions. Word has length 103 [2019-09-08 12:29:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:33,348 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 891 transitions. [2019-09-08 12:29:33,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 891 transitions. [2019-09-08 12:29:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:33,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:33,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:33,350 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1234979639, now seen corresponding path program 1 times [2019-09-08 12:29:33,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:33,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:33,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:33,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:33,570 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:29:33,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:33,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:33,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:33,572 INFO L87 Difference]: Start difference. First operand 705 states and 891 transitions. Second operand 9 states. [2019-09-08 12:29:36,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:36,147 INFO L93 Difference]: Finished difference Result 1381 states and 1798 transitions. [2019-09-08 12:29:36,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:36,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:36,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:36,150 INFO L225 Difference]: With dead ends: 1381 [2019-09-08 12:29:36,150 INFO L226 Difference]: Without dead ends: 1234 [2019-09-08 12:29:36,152 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:29:36,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-09-08 12:29:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 705. [2019-09-08 12:29:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 12:29:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 890 transitions. [2019-09-08 12:29:36,260 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 890 transitions. Word has length 103 [2019-09-08 12:29:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:36,260 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 890 transitions. [2019-09-08 12:29:36,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 890 transitions. [2019-09-08 12:29:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:36,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:36,261 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] [2019-09-08 12:29:36,262 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:36,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 429596489, now seen corresponding path program 1 times [2019-09-08 12:29:36,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:36,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:36,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:36,465 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:29:36,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:36,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:36,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:36,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:36,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:36,466 INFO L87 Difference]: Start difference. First operand 705 states and 890 transitions. Second operand 9 states. [2019-09-08 12:29:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:38,977 INFO L93 Difference]: Finished difference Result 1300 states and 1687 transitions. [2019-09-08 12:29:38,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:38,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:38,982 INFO L225 Difference]: With dead ends: 1300 [2019-09-08 12:29:38,982 INFO L226 Difference]: Without dead ends: 1211 [2019-09-08 12:29:38,983 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:29:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-08 12:29:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 705. [2019-09-08 12:29:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-09-08 12:29:39,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 889 transitions. [2019-09-08 12:29:39,106 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 889 transitions. Word has length 103 [2019-09-08 12:29:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:39,106 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 889 transitions. [2019-09-08 12:29:39,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 889 transitions. [2019-09-08 12:29:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:39,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:39,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] [2019-09-08 12:29:39,108 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1112545982, now seen corresponding path program 1 times [2019-09-08 12:29:39,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:39,368 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:29:39,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:39,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:39,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:39,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:39,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:39,369 INFO L87 Difference]: Start difference. First operand 705 states and 889 transitions. Second operand 9 states. [2019-09-08 12:29:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:41,706 INFO L93 Difference]: Finished difference Result 1254 states and 1616 transitions. [2019-09-08 12:29:41,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:41,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:41,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:41,709 INFO L225 Difference]: With dead ends: 1254 [2019-09-08 12:29:41,709 INFO L226 Difference]: Without dead ends: 1178 [2019-09-08 12:29:41,710 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:29:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-08 12:29:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 704. [2019-09-08 12:29:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-09-08 12:29:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 887 transitions. [2019-09-08 12:29:41,789 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 887 transitions. Word has length 103 [2019-09-08 12:29:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:41,790 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 887 transitions. [2019-09-08 12:29:41,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 887 transitions. [2019-09-08 12:29:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:41,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:41,791 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] [2019-09-08 12:29:41,791 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:41,792 INFO L82 PathProgramCache]: Analyzing trace with hash -462834018, now seen corresponding path program 1 times [2019-09-08 12:29:41,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:41,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:41,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:41,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:41,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:41,966 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:29:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:41,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:41,967 INFO L87 Difference]: Start difference. First operand 704 states and 887 transitions. Second operand 9 states. [2019-09-08 12:29:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:44,317 INFO L93 Difference]: Finished difference Result 1253 states and 1614 transitions. [2019-09-08 12:29:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:44,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:44,319 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:29:44,320 INFO L226 Difference]: Without dead ends: 1177 [2019-09-08 12:29:44,321 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:29:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-09-08 12:29:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 703. [2019-09-08 12:29:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-08 12:29:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 885 transitions. [2019-09-08 12:29:44,396 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 885 transitions. Word has length 103 [2019-09-08 12:29:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 885 transitions. [2019-09-08 12:29:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 885 transitions. [2019-09-08 12:29:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:44,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:44,398 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] [2019-09-08 12:29:44,398 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash 368358430, now seen corresponding path program 1 times [2019-09-08 12:29:44,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:44,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:44,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:44,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:44,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:45,049 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 12:29:45,404 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:29:45,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:45,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:29:45,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:29:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:29:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:29:45,405 INFO L87 Difference]: Start difference. First operand 703 states and 885 transitions. Second operand 17 states. [2019-09-08 12:29:46,102 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 12:29:46,253 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-09-08 12:29:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:50,639 INFO L93 Difference]: Finished difference Result 1388 states and 1789 transitions. [2019-09-08 12:29:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:29:50,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 103 [2019-09-08 12:29:50,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:50,642 INFO L225 Difference]: With dead ends: 1388 [2019-09-08 12:29:50,642 INFO L226 Difference]: Without dead ends: 1312 [2019-09-08 12:29:50,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:29:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-09-08 12:29:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 703. [2019-09-08 12:29:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-09-08 12:29:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 883 transitions. [2019-09-08 12:29:50,732 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 883 transitions. Word has length 103 [2019-09-08 12:29:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:50,733 INFO L475 AbstractCegarLoop]: Abstraction has 703 states and 883 transitions. [2019-09-08 12:29:50,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:29:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 883 transitions. [2019-09-08 12:29:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 12:29:50,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:50,734 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] [2019-09-08 12:29:50,734 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -440894658, now seen corresponding path program 1 times [2019-09-08 12:29:50,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:50,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:50,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:50,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:50,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:50,979 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:29:50,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:50,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:50,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:50,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:50,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:50,980 INFO L87 Difference]: Start difference. First operand 703 states and 883 transitions. Second operand 9 states. [2019-09-08 12:29:53,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:53,318 INFO L93 Difference]: Finished difference Result 1251 states and 1609 transitions. [2019-09-08 12:29:53,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:53,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-08 12:29:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:53,320 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:29:53,320 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:29:53,320 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:29:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:29:53,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:29:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:29:53,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 881 transitions. [2019-09-08 12:29:53,407 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 881 transitions. Word has length 103 [2019-09-08 12:29:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:53,407 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 881 transitions. [2019-09-08 12:29:53,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 881 transitions. [2019-09-08 12:29:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:29:53,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:53,409 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] [2019-09-08 12:29:53,409 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1453139291, now seen corresponding path program 1 times [2019-09-08 12:29:53,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:53,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:53,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:29:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:53,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:53,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:53,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:53,624 INFO L87 Difference]: Start difference. First operand 702 states and 881 transitions. Second operand 9 states. [2019-09-08 12:29:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:55,950 INFO L93 Difference]: Finished difference Result 1253 states and 1609 transitions. [2019-09-08 12:29:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:55,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:29:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:55,952 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:29:55,952 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:29:55,953 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:29:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:29:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:29:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:29:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 880 transitions. [2019-09-08 12:29:56,047 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 880 transitions. Word has length 104 [2019-09-08 12:29:56,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:56,047 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 880 transitions. [2019-09-08 12:29:56,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 880 transitions. [2019-09-08 12:29:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:29:56,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:56,049 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] [2019-09-08 12:29:56,049 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:56,050 INFO L82 PathProgramCache]: Analyzing trace with hash -872187749, now seen corresponding path program 1 times [2019-09-08 12:29:56,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:56,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:56,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:56,326 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:29:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:56,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:56,328 INFO L87 Difference]: Start difference. First operand 702 states and 880 transitions. Second operand 9 states. [2019-09-08 12:29:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:58,764 INFO L93 Difference]: Finished difference Result 1253 states and 1608 transitions. [2019-09-08 12:29:58,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:29:58,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:29:58,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:58,766 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:29:58,766 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:29:58,767 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:29:58,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:29:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:29:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:29:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 879 transitions. [2019-09-08 12:29:58,860 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 879 transitions. Word has length 104 [2019-09-08 12:29:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:58,860 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 879 transitions. [2019-09-08 12:29:58,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:29:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 879 transitions. [2019-09-08 12:29:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:29:58,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:58,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] [2019-09-08 12:29:58,862 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:58,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:58,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1637494085, now seen corresponding path program 1 times [2019-09-08 12:29:58,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:58,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:58,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:59,047 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:29:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:29:59,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:29:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:29:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:29:59,049 INFO L87 Difference]: Start difference. First operand 702 states and 879 transitions. Second operand 9 states. [2019-09-08 12:30:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:01,494 INFO L93 Difference]: Finished difference Result 1253 states and 1607 transitions. [2019-09-08 12:30:01,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:01,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:01,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:01,497 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:01,497 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:01,498 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:30:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 878 transitions. [2019-09-08 12:30:01,590 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 878 transitions. Word has length 104 [2019-09-08 12:30:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:01,590 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 878 transitions. [2019-09-08 12:30:01,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 878 transitions. [2019-09-08 12:30:01,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:01,591 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:01,591 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] [2019-09-08 12:30:01,591 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:01,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:01,592 INFO L82 PathProgramCache]: Analyzing trace with hash -18959589, now seen corresponding path program 1 times [2019-09-08 12:30:01,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:01,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:01,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:01,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:01,796 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:30:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:01,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:01,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:01,798 INFO L87 Difference]: Start difference. First operand 702 states and 878 transitions. Second operand 9 states. [2019-09-08 12:30:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:04,113 INFO L93 Difference]: Finished difference Result 1253 states and 1605 transitions. [2019-09-08 12:30:04,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:04,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:04,115 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:04,115 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:04,116 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:30:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:04,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 877 transitions. [2019-09-08 12:30:04,208 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 877 transitions. Word has length 104 [2019-09-08 12:30:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:04,208 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 877 transitions. [2019-09-08 12:30:04,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 877 transitions. [2019-09-08 12:30:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:04,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:04,210 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] [2019-09-08 12:30:04,210 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -803008197, now seen corresponding path program 1 times [2019-09-08 12:30:04,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:04,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:04,422 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:30:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:04,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:04,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:04,423 INFO L87 Difference]: Start difference. First operand 702 states and 877 transitions. Second operand 9 states. [2019-09-08 12:30:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:07,473 INFO L93 Difference]: Finished difference Result 1253 states and 1604 transitions. [2019-09-08 12:30:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:07,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:07,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:07,475 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:07,475 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:07,476 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:30:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 876 transitions. [2019-09-08 12:30:07,568 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 876 transitions. Word has length 104 [2019-09-08 12:30:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:07,568 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 876 transitions. [2019-09-08 12:30:07,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 876 transitions. [2019-09-08 12:30:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:07,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:07,569 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] [2019-09-08 12:30:07,569 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:07,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1301956699, now seen corresponding path program 1 times [2019-09-08 12:30:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:07,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:07,734 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:30:07,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:07,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:07,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:07,736 INFO L87 Difference]: Start difference. First operand 702 states and 876 transitions. Second operand 9 states. [2019-09-08 12:30:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:10,059 INFO L93 Difference]: Finished difference Result 1253 states and 1603 transitions. [2019-09-08 12:30:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:10,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:10,060 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:10,061 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:10,061 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:30:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:10,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 875 transitions. [2019-09-08 12:30:10,157 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 875 transitions. Word has length 104 [2019-09-08 12:30:10,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:10,157 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 875 transitions. [2019-09-08 12:30:10,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 875 transitions. [2019-09-08 12:30:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:10,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:10,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] [2019-09-08 12:30:10,159 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:10,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash -369299811, now seen corresponding path program 1 times [2019-09-08 12:30:10,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:10,347 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:30:10,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:10,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:10,348 INFO L87 Difference]: Start difference. First operand 702 states and 875 transitions. Second operand 9 states. [2019-09-08 12:30:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:12,645 INFO L93 Difference]: Finished difference Result 1251 states and 1599 transitions. [2019-09-08 12:30:12,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:12,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:12,647 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:30:12,647 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:12,648 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:30:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:12,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:12,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 874 transitions. [2019-09-08 12:30:12,747 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 874 transitions. Word has length 104 [2019-09-08 12:30:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:12,747 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 874 transitions. [2019-09-08 12:30:12,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 874 transitions. [2019-09-08 12:30:12,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:12,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:12,748 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] [2019-09-08 12:30:12,749 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:12,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash -339789701, now seen corresponding path program 1 times [2019-09-08 12:30:12,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:12,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:12,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:12,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:12,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:12,969 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:30:12,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:12,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:12,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:12,970 INFO L87 Difference]: Start difference. First operand 702 states and 874 transitions. Second operand 9 states. [2019-09-08 12:30:15,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:15,421 INFO L93 Difference]: Finished difference Result 1253 states and 1600 transitions. [2019-09-08 12:30:15,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:15,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:15,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:15,423 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:15,424 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:15,425 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:30:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 873 transitions. [2019-09-08 12:30:15,547 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 873 transitions. Word has length 104 [2019-09-08 12:30:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:15,548 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 873 transitions. [2019-09-08 12:30:15,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 873 transitions. [2019-09-08 12:30:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:15,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:15,549 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] [2019-09-08 12:30:15,549 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:15,550 INFO L82 PathProgramCache]: Analyzing trace with hash 480435067, now seen corresponding path program 1 times [2019-09-08 12:30:15,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:15,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:15,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:15,754 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:30:15,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:15,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:15,756 INFO L87 Difference]: Start difference. First operand 702 states and 873 transitions. Second operand 9 states. [2019-09-08 12:30:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:18,347 INFO L93 Difference]: Finished difference Result 1253 states and 1599 transitions. [2019-09-08 12:30:18,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:18,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:18,349 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:18,349 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:18,350 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:30:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:18,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:18,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 872 transitions. [2019-09-08 12:30:18,453 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 872 transitions. Word has length 104 [2019-09-08 12:30:18,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:18,453 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 872 transitions. [2019-09-08 12:30:18,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:18,453 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 872 transitions. [2019-09-08 12:30:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:18,454 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:18,454 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] [2019-09-08 12:30:18,454 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash -696828453, now seen corresponding path program 1 times [2019-09-08 12:30:18,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:18,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30: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:30:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:18,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:18,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:18,624 INFO L87 Difference]: Start difference. First operand 702 states and 872 transitions. Second operand 9 states. [2019-09-08 12:30:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:20,934 INFO L93 Difference]: Finished difference Result 1253 states and 1597 transitions. [2019-09-08 12:30:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:20,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-09-08 12:30:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:20,937 INFO L225 Difference]: With dead ends: 1253 [2019-09-08 12:30:20,937 INFO L226 Difference]: Without dead ends: 1175 [2019-09-08 12:30:20,938 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:30:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-09-08 12:30:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 702. [2019-09-08 12:30:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 12:30:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 871 transitions. [2019-09-08 12:30:21,072 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 871 transitions. Word has length 104 [2019-09-08 12:30:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:21,072 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 871 transitions. [2019-09-08 12:30:21,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 871 transitions. [2019-09-08 12:30:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 12:30:21,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:21,074 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] [2019-09-08 12:30:21,074 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1221610680, now seen corresponding path program 1 times [2019-09-08 12:30:21,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:21,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:21,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:22,332 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:30:22,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:22,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 12:30:22,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 12:30:22,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 12:30:22,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:30:22,333 INFO L87 Difference]: Start difference. First operand 702 states and 871 transitions. Second operand 20 states. [2019-09-08 12:30:22,585 WARN L188 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-09-08 12:30:22,887 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-08 12:30:23,064 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-09-08 12:30:23,279 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 12:30:23,508 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-08 12:30:23,787 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2019-09-08 12:30:24,242 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-08 12:30:24,637 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-09-08 12:30:24,971 WARN L188 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-08 12:30:25,298 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-09-08 12:30:25,751 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-09-08 12:30:26,162 WARN L188 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2019-09-08 12:30:26,445 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-09-08 12:30:26,745 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-08 12:30:27,010 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-08 12:30:27,551 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-09-08 12:30:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:33,496 INFO L93 Difference]: Finished difference Result 1620 states and 2009 transitions. [2019-09-08 12:30:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 12:30:33,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-08 12:30:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:33,499 INFO L225 Difference]: With dead ends: 1620 [2019-09-08 12:30:33,499 INFO L226 Difference]: Without dead ends: 1540 [2019-09-08 12:30:33,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 12:30:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2019-09-08 12:30:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 697. [2019-09-08 12:30:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 865 transitions. [2019-09-08 12:30:33,659 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 865 transitions. Word has length 104 [2019-09-08 12:30:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:33,659 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 865 transitions. [2019-09-08 12:30:33,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 12:30:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 865 transitions. [2019-09-08 12:30:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:33,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:33,660 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] [2019-09-08 12:30:33,660 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:33,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1629361838, now seen corresponding path program 1 times [2019-09-08 12:30:33,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:33,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:33,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:33,869 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:30:33,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:33,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:33,872 INFO L87 Difference]: Start difference. First operand 697 states and 865 transitions. Second operand 9 states. [2019-09-08 12:30:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:36,241 INFO L93 Difference]: Finished difference Result 1296 states and 1660 transitions. [2019-09-08 12:30:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:36,241 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:36,243 INFO L225 Difference]: With dead ends: 1296 [2019-09-08 12:30:36,243 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:30:36,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:30:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:30:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-08 12:30:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 864 transitions. [2019-09-08 12:30:36,367 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 864 transitions. Word has length 105 [2019-09-08 12:30:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:36,367 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 864 transitions. [2019-09-08 12:30:36,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 864 transitions. [2019-09-08 12:30:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:36,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:36,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] [2019-09-08 12:30:36,369 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 796878734, now seen corresponding path program 1 times [2019-09-08 12:30:36,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:36,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:36,585 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:30:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:36,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:36,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:36,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:36,587 INFO L87 Difference]: Start difference. First operand 697 states and 864 transitions. Second operand 9 states. [2019-09-08 12:30:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:38,941 INFO L93 Difference]: Finished difference Result 1251 states and 1591 transitions. [2019-09-08 12:30:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:38,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:38,943 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:30:38,943 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:38,943 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:30:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 863 transitions. [2019-09-08 12:30:39,080 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 863 transitions. Word has length 105 [2019-09-08 12:30:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:39,080 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 863 transitions. [2019-09-08 12:30:39,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2019-09-08 12:30:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:39,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:39,082 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] [2019-09-08 12:30:39,083 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash 585181006, now seen corresponding path program 1 times [2019-09-08 12:30:39,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:39,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:39,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:39,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:30:39,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:39,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:39,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:39,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:39,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:39,281 INFO L87 Difference]: Start difference. First operand 697 states and 863 transitions. Second operand 9 states. [2019-09-08 12:30:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:41,827 INFO L93 Difference]: Finished difference Result 1337 states and 1710 transitions. [2019-09-08 12:30:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:41,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:41,829 INFO L225 Difference]: With dead ends: 1337 [2019-09-08 12:30:41,829 INFO L226 Difference]: Without dead ends: 1218 [2019-09-08 12:30:41,829 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:30:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2019-09-08 12:30:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 697. [2019-09-08 12:30:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 862 transitions. [2019-09-08 12:30:41,971 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 862 transitions. Word has length 105 [2019-09-08 12:30:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:41,971 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 862 transitions. [2019-09-08 12:30:41,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 862 transitions. [2019-09-08 12:30:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:41,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:41,972 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] [2019-09-08 12:30:41,973 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:41,973 INFO L82 PathProgramCache]: Analyzing trace with hash 126959758, now seen corresponding path program 1 times [2019-09-08 12:30:41,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:41,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:41,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:41,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:41,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:42,165 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:30:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:42,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:42,166 INFO L87 Difference]: Start difference. First operand 697 states and 862 transitions. Second operand 9 states. [2019-09-08 12:30:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:44,365 INFO L93 Difference]: Finished difference Result 1296 states and 1657 transitions. [2019-09-08 12:30:44,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:44,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:44,367 INFO L225 Difference]: With dead ends: 1296 [2019-09-08 12:30:44,367 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:30:44,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:30:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:30:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-08 12:30:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 861 transitions. [2019-09-08 12:30:44,496 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 861 transitions. Word has length 105 [2019-09-08 12:30:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:44,496 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 861 transitions. [2019-09-08 12:30:44,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 861 transitions. [2019-09-08 12:30:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:44,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:44,498 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] [2019-09-08 12:30:44,498 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash -705523346, now seen corresponding path program 1 times [2019-09-08 12:30:44,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:44,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:44,684 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:30:44,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:44,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:44,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:44,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:44,685 INFO L87 Difference]: Start difference. First operand 697 states and 861 transitions. Second operand 9 states. [2019-09-08 12:30:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:46,930 INFO L93 Difference]: Finished difference Result 1251 states and 1588 transitions. [2019-09-08 12:30:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:46,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:46,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:46,932 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:30:46,932 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:46,933 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:30:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 860 transitions. [2019-09-08 12:30:47,079 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 860 transitions. Word has length 105 [2019-09-08 12:30:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:47,079 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 860 transitions. [2019-09-08 12:30:47,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 860 transitions. [2019-09-08 12:30:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:47,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:47,080 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] [2019-09-08 12:30:47,080 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1644071758, now seen corresponding path program 1 times [2019-09-08 12:30:47,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:47,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:47,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:47,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:47,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:47,271 INFO L87 Difference]: Start difference. First operand 697 states and 860 transitions. Second operand 9 states. [2019-09-08 12:30:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:49,353 INFO L93 Difference]: Finished difference Result 1251 states and 1587 transitions. [2019-09-08 12:30:49,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:49,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:49,355 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:30:49,355 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:49,356 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:30:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 859 transitions. [2019-09-08 12:30:49,498 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 859 transitions. Word has length 105 [2019-09-08 12:30:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:49,498 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 859 transitions. [2019-09-08 12:30:49,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 859 transitions. [2019-09-08 12:30:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:49,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:49,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] [2019-09-08 12:30:49,499 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -916618386, now seen corresponding path program 1 times [2019-09-08 12:30:49,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:49,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:49,708 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:30:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:49,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:49,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:49,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:49,709 INFO L87 Difference]: Start difference. First operand 697 states and 859 transitions. Second operand 9 states. [2019-09-08 12:30:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:51,936 INFO L93 Difference]: Finished difference Result 1176 states and 1474 transitions. [2019-09-08 12:30:51,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:51,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:51,938 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 12:30:51,938 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:51,939 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:30:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 858 transitions. [2019-09-08 12:30:52,070 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 858 transitions. Word has length 105 [2019-09-08 12:30:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:52,070 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 858 transitions. [2019-09-08 12:30:52,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 858 transitions. [2019-09-08 12:30:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:52,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:52,071 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] [2019-09-08 12:30:52,071 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1550934542, now seen corresponding path program 1 times [2019-09-08 12:30:52,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:52,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:52,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:52,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:30:52,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:52,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:52,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:52,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:52,252 INFO L87 Difference]: Start difference. First operand 697 states and 858 transitions. Second operand 9 states. [2019-09-08 12:30:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:54,495 INFO L93 Difference]: Finished difference Result 1221 states and 1539 transitions. [2019-09-08 12:30:54,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:54,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:54,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:54,497 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 12:30:54,497 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:30:54,498 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:30:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:30:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-08 12:30:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 857 transitions. [2019-09-08 12:30:54,655 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 857 transitions. Word has length 105 [2019-09-08 12:30:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:54,655 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 857 transitions. [2019-09-08 12:30:54,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 857 transitions. [2019-09-08 12:30:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:54,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:54,656 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] [2019-09-08 12:30:54,656 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -825223794, now seen corresponding path program 1 times [2019-09-08 12:30:54,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:54,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:54,831 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:30:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:54,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:54,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:54,832 INFO L87 Difference]: Start difference. First operand 697 states and 857 transitions. Second operand 9 states. [2019-09-08 12:30:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:57,059 INFO L93 Difference]: Finished difference Result 1176 states and 1472 transitions. [2019-09-08 12:30:57,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:57,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:57,061 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 12:30:57,061 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:57,061 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:30:57,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:57,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 856 transitions. [2019-09-08 12:30:57,192 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 856 transitions. Word has length 105 [2019-09-08 12:30:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:57,192 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 856 transitions. [2019-09-08 12:30:57,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 856 transitions. [2019-09-08 12:30:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:57,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:57,193 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] [2019-09-08 12:30:57,194 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -180694834, now seen corresponding path program 1 times [2019-09-08 12:30:57,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:57,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:57,359 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:30:57,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:57,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:57,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:57,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:57,360 INFO L87 Difference]: Start difference. First operand 697 states and 856 transitions. Second operand 9 states. [2019-09-08 12:30:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:59,471 INFO L93 Difference]: Finished difference Result 1176 states and 1470 transitions. [2019-09-08 12:30:59,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:30:59,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:30:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:59,472 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 12:30:59,473 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:30:59,473 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:30:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:30:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:30:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:30:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 855 transitions. [2019-09-08 12:30:59,614 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 855 transitions. Word has length 105 [2019-09-08 12:30:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:59,614 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 855 transitions. [2019-09-08 12:30:59,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:30:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 855 transitions. [2019-09-08 12:30:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:30:59,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:59,616 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] [2019-09-08 12:30:59,616 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1974492206, now seen corresponding path program 1 times [2019-09-08 12:30:59,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:59,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:59,788 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:30:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:30:59,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:30:59,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:30:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:30:59,789 INFO L87 Difference]: Start difference. First operand 697 states and 855 transitions. Second operand 9 states. [2019-09-08 12:31:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:01,925 INFO L93 Difference]: Finished difference Result 1251 states and 1579 transitions. [2019-09-08 12:31:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:01,925 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:31:01,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:01,926 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:31:01,927 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:31:01,927 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:31:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:31:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:31:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:31:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 854 transitions. [2019-09-08 12:31:02,079 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 854 transitions. Word has length 105 [2019-09-08 12:31:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:02,079 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 854 transitions. [2019-09-08 12:31:02,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 854 transitions. [2019-09-08 12:31:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:31:02,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:02,081 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] [2019-09-08 12:31:02,081 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1864649998, now seen corresponding path program 1 times [2019-09-08 12:31:02,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:02,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:02,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:02,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:02,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:02,282 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:31:02,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:02,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:02,283 INFO L87 Difference]: Start difference. First operand 697 states and 854 transitions. Second operand 9 states. [2019-09-08 12:31:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:04,707 INFO L93 Difference]: Finished difference Result 1296 states and 1643 transitions. [2019-09-08 12:31:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:04,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:31:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:04,709 INFO L225 Difference]: With dead ends: 1296 [2019-09-08 12:31:04,709 INFO L226 Difference]: Without dead ends: 1202 [2019-09-08 12:31:04,710 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:31:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2019-09-08 12:31:04,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 697. [2019-09-08 12:31:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:31:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 853 transitions. [2019-09-08 12:31:04,846 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 853 transitions. Word has length 105 [2019-09-08 12:31:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:04,847 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 853 transitions. [2019-09-08 12:31:04,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 853 transitions. [2019-09-08 12:31:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:31:04,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:04,848 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] [2019-09-08 12:31:04,848 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:04,849 INFO L82 PathProgramCache]: Analyzing trace with hash -387747698, now seen corresponding path program 1 times [2019-09-08 12:31:04,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:04,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:04,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:04,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:05,015 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:31:05,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:05,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:05,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:05,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:05,016 INFO L87 Difference]: Start difference. First operand 697 states and 853 transitions. Second operand 9 states. [2019-09-08 12:31:07,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:07,330 INFO L93 Difference]: Finished difference Result 1251 states and 1577 transitions. [2019-09-08 12:31:07,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:07,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:31:07,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:07,332 INFO L225 Difference]: With dead ends: 1251 [2019-09-08 12:31:07,333 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:31:07,333 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:31:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:31:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:31:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:31:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 852 transitions. [2019-09-08 12:31:07,480 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 852 transitions. Word has length 105 [2019-09-08 12:31:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:07,480 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 852 transitions. [2019-09-08 12:31:07,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 852 transitions. [2019-09-08 12:31:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 12:31:07,481 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:07,481 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] [2019-09-08 12:31:07,481 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:07,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1642130034, now seen corresponding path program 1 times [2019-09-08 12:31:07,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:07,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:07,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:07,650 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:31:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:31:07,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:31:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:31:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:31:07,652 INFO L87 Difference]: Start difference. First operand 697 states and 852 transitions. Second operand 9 states. [2019-09-08 12:31:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:10,142 INFO L93 Difference]: Finished difference Result 1176 states and 1464 transitions. [2019-09-08 12:31:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:31:10,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-08 12:31:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:10,144 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 12:31:10,144 INFO L226 Difference]: Without dead ends: 1170 [2019-09-08 12:31:10,145 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:31:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-09-08 12:31:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 697. [2019-09-08 12:31:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:31:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 851 transitions. [2019-09-08 12:31:10,292 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 851 transitions. Word has length 105 [2019-09-08 12:31:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:10,292 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 851 transitions. [2019-09-08 12:31:10,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:31:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 851 transitions. [2019-09-08 12:31:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:10,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:10,294 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] [2019-09-08 12:31:10,294 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash -543142122, now seen corresponding path program 1 times [2019-09-08 12:31:10,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:12,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:31:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 12:31:12,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 12:31:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 12:31:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-09-08 12:31:12,134 INFO L87 Difference]: Start difference. First operand 697 states and 851 transitions. Second operand 26 states. [2019-09-08 12:31:12,298 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-08 12:31:13,483 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-08 12:31:13,738 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2019-09-08 12:31:14,038 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:31:14,425 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-09-08 12:31:14,677 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:31:14,901 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-08 12:31:15,141 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-09-08 12:31:22,038 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-08 12:31:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:25,215 INFO L93 Difference]: Finished difference Result 1668 states and 2117 transitions. [2019-09-08 12:31:25,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:31:25,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-09-08 12:31:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:25,217 INFO L225 Difference]: With dead ends: 1668 [2019-09-08 12:31:25,217 INFO L226 Difference]: Without dead ends: 1592 [2019-09-08 12:31:25,218 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=373, Invalid=1433, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:31:25,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2019-09-08 12:31:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 724. [2019-09-08 12:31:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-09-08 12:31:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 885 transitions. [2019-09-08 12:31:25,405 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 885 transitions. Word has length 106 [2019-09-08 12:31:25,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:25,405 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 885 transitions. [2019-09-08 12:31:25,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 12:31:25,405 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 885 transitions. [2019-09-08 12:31:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:25,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:25,407 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] [2019-09-08 12:31:25,407 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 128153622, now seen corresponding path program 1 times [2019-09-08 12:31:25,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:25,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:25,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:25,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:26,155 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:31:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:26,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:31:26,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:31:26,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:31:26,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:31:26,156 INFO L87 Difference]: Start difference. First operand 724 states and 885 transitions. Second operand 17 states. [2019-09-08 12:31:26,796 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:31:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:29,321 INFO L93 Difference]: Finished difference Result 1471 states and 1857 transitions. [2019-09-08 12:31:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:31:29,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-08 12:31:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:29,323 INFO L225 Difference]: With dead ends: 1471 [2019-09-08 12:31:29,323 INFO L226 Difference]: Without dead ends: 1330 [2019-09-08 12:31:29,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:31:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-09-08 12:31:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 697. [2019-09-08 12:31:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-08 12:31:29,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 850 transitions. [2019-09-08 12:31:29,504 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 850 transitions. Word has length 106 [2019-09-08 12:31:29,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:29,504 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 850 transitions. [2019-09-08 12:31:29,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:31:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 850 transitions. [2019-09-08 12:31:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:29,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:29,506 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] [2019-09-08 12:31:29,506 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:29,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2118591338, now seen corresponding path program 1 times [2019-09-08 12:31:29,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:29,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:29,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:29,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:30,316 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:31:30,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:30,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:31:30,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:31:30,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:31:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:31:30,318 INFO L87 Difference]: Start difference. First operand 697 states and 850 transitions. Second operand 16 states. [2019-09-08 12:31:30,982 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:31:31,112 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:31,241 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:31:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:34,614 INFO L93 Difference]: Finished difference Result 1289 states and 1563 transitions. [2019-09-08 12:31:34,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:31:34,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2019-09-08 12:31:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:34,616 INFO L225 Difference]: With dead ends: 1289 [2019-09-08 12:31:34,616 INFO L226 Difference]: Without dead ends: 1213 [2019-09-08 12:31:34,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:31:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-09-08 12:31:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 720. [2019-09-08 12:31:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-09-08 12:31:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 881 transitions. [2019-09-08 12:31:34,797 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 881 transitions. Word has length 106 [2019-09-08 12:31:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:34,798 INFO L475 AbstractCegarLoop]: Abstraction has 720 states and 881 transitions. [2019-09-08 12:31:34,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:31:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 881 transitions. [2019-09-08 12:31:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:34,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:34,799 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] [2019-09-08 12:31:34,800 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:34,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:34,800 INFO L82 PathProgramCache]: Analyzing trace with hash 715197526, now seen corresponding path program 1 times [2019-09-08 12:31:34,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:34,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:35,569 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:31:35,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:35,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:31:35,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:31:35,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:31:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:31:35,570 INFO L87 Difference]: Start difference. First operand 720 states and 881 transitions. Second operand 17 states. [2019-09-08 12:31:36,185 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 12:31:36,330 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-09-08 12:31:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:38,589 INFO L93 Difference]: Finished difference Result 1442 states and 1817 transitions. [2019-09-08 12:31:38,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:31:38,590 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 106 [2019-09-08 12:31:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:38,592 INFO L225 Difference]: With dead ends: 1442 [2019-09-08 12:31:38,592 INFO L226 Difference]: Without dead ends: 1221 [2019-09-08 12:31:38,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:31:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-09-08 12:31:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 665. [2019-09-08 12:31:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-09-08 12:31:38,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 809 transitions. [2019-09-08 12:31:38,776 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 809 transitions. Word has length 106 [2019-09-08 12:31:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:38,777 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 809 transitions. [2019-09-08 12:31:38,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:31:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 809 transitions. [2019-09-08 12:31:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:38,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:38,778 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] [2019-09-08 12:31:38,778 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1432850954, now seen corresponding path program 1 times [2019-09-08 12:31:38,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:38,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:40,281 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:31:40,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:40,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 12:31:40,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 12:31:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 12:31:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2019-09-08 12:31:40,283 INFO L87 Difference]: Start difference. First operand 665 states and 809 transitions. Second operand 25 states. [2019-09-08 12:31:40,434 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:31:41,359 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-08 12:31:41,711 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2019-09-08 12:31:41,983 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-09-08 12:31:42,302 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-09-08 12:31:42,523 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:31:42,745 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-08 12:31:42,958 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-08 12:31:43,134 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:31:43,332 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-08 12:31:43,574 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-09-08 12:31:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:50,330 INFO L93 Difference]: Finished difference Result 1611 states and 1978 transitions. [2019-09-08 12:31:50,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 12:31:50,331 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2019-09-08 12:31:50,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:50,332 INFO L225 Difference]: With dead ends: 1611 [2019-09-08 12:31:50,332 INFO L226 Difference]: Without dead ends: 1470 [2019-09-08 12:31:50,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:31:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-08 12:31:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 678. [2019-09-08 12:31:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-09-08 12:31:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 823 transitions. [2019-09-08 12:31:50,573 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 823 transitions. Word has length 106 [2019-09-08 12:31:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:50,573 INFO L475 AbstractCegarLoop]: Abstraction has 678 states and 823 transitions. [2019-09-08 12:31:50,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 12:31:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 823 transitions. [2019-09-08 12:31:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 12:31:50,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:50,574 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] [2019-09-08 12:31:50,574 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:50,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1395534550, now seen corresponding path program 1 times [2019-09-08 12:31:50,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:50,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:50,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:50,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:51,204 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:31:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 12:31:51,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 12:31:51,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 12:31:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:31:51,205 INFO L87 Difference]: Start difference. First operand 678 states and 823 transitions. Second operand 15 states. [2019-09-08 12:31:51,750 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:31:51,879 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:31:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:54,120 INFO L93 Difference]: Finished difference Result 1569 states and 1974 transitions. [2019-09-08 12:31:54,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:31:54,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2019-09-08 12:31:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:54,123 INFO L225 Difference]: With dead ends: 1569 [2019-09-08 12:31:54,123 INFO L226 Difference]: Without dead ends: 1249 [2019-09-08 12:31:54,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:31:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2019-09-08 12:31:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 562. [2019-09-08 12:31:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 12:31:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 678 transitions. [2019-09-08 12:31:54,285 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 678 transitions. Word has length 106 [2019-09-08 12:31:54,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:54,286 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 678 transitions. [2019-09-08 12:31:54,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 12:31:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 678 transitions. [2019-09-08 12:31:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:31:54,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:54,287 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] [2019-09-08 12:31:54,287 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:54,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash -219637197, now seen corresponding path program 1 times [2019-09-08 12:31:54,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:54,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:55,207 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 12:31:55,354 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-08 12:31:55,511 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-08 12:31:55,663 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:31:56,914 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:31:56,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:56,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-08 12:31:56,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 12:31:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 12:31:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-08 12:31:56,915 INFO L87 Difference]: Start difference. First operand 562 states and 678 transitions. Second operand 31 states. [2019-09-08 12:31:57,119 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-09-08 12:31:58,254 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 12:31:58,426 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:31:58,896 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 12:31:59,185 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-09-08 12:31:59,521 WARN L188 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-09-08 12:31:59,940 WARN L188 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-09-08 12:32:00,452 WARN L188 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 104 [2019-09-08 12:32:00,741 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:32:01,045 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2019-09-08 12:32:01,374 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-09-08 12:32:08,346 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-09-08 12:32:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:10,285 INFO L93 Difference]: Finished difference Result 1079 states and 1318 transitions. [2019-09-08 12:32:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 12:32:10,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2019-09-08 12:32:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:10,287 INFO L225 Difference]: With dead ends: 1079 [2019-09-08 12:32:10,287 INFO L226 Difference]: Without dead ends: 1000 [2019-09-08 12:32:10,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 12:32:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-09-08 12:32:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 573. [2019-09-08 12:32:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-08 12:32:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 694 transitions. [2019-09-08 12:32:10,457 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 694 transitions. Word has length 107 [2019-09-08 12:32:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:10,457 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 694 transitions. [2019-09-08 12:32:10,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 12:32:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 694 transitions. [2019-09-08 12:32:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:10,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:10,458 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] [2019-09-08 12:32:10,459 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:10,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:10,459 INFO L82 PathProgramCache]: Analyzing trace with hash 294360019, now seen corresponding path program 1 times [2019-09-08 12:32:10,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:10,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:10,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:11,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:32:11,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:11,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:32:11,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:11,253 INFO L87 Difference]: Start difference. First operand 573 states and 694 transitions. Second operand 17 states. [2019-09-08 12:32:11,942 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-08 12:32:12,104 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 12:32:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:14,597 INFO L93 Difference]: Finished difference Result 1126 states and 1429 transitions. [2019-09-08 12:32:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:32:14,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-08 12:32:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:14,598 INFO L225 Difference]: With dead ends: 1126 [2019-09-08 12:32:14,598 INFO L226 Difference]: Without dead ends: 1015 [2019-09-08 12:32:14,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-09-08 12:32:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 552. [2019-09-08 12:32:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-08 12:32:14,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 665 transitions. [2019-09-08 12:32:14,796 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 665 transitions. Word has length 107 [2019-09-08 12:32:14,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:14,796 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 665 transitions. [2019-09-08 12:32:14,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:14,796 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 665 transitions. [2019-09-08 12:32:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:14,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:14,797 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] [2019-09-08 12:32:14,797 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1716120548, now seen corresponding path program 1 times [2019-09-08 12:32:14,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:14,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:14,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:15,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:15,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:32:15,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:32:15,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:32:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:32:15,340 INFO L87 Difference]: Start difference. First operand 552 states and 665 transitions. Second operand 12 states. [2019-09-08 12:32:15,595 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-09-08 12:32:16,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:16,864 INFO L93 Difference]: Finished difference Result 1186 states and 1537 transitions. [2019-09-08 12:32:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 12:32:16,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2019-09-08 12:32:16,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:16,866 INFO L225 Difference]: With dead ends: 1186 [2019-09-08 12:32:16,866 INFO L226 Difference]: Without dead ends: 1099 [2019-09-08 12:32:16,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:32:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-08 12:32:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 540. [2019-09-08 12:32:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-09-08 12:32:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 650 transitions. [2019-09-08 12:32:17,061 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 650 transitions. Word has length 107 [2019-09-08 12:32:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:17,061 INFO L475 AbstractCegarLoop]: Abstraction has 540 states and 650 transitions. [2019-09-08 12:32:17,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:32:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 650 transitions. [2019-09-08 12:32:17,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:17,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:17,062 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] [2019-09-08 12:32:17,062 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:17,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:17,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1681056201, now seen corresponding path program 1 times [2019-09-08 12:32:17,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:17,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:17,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:17,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:17,814 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:32:17,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:17,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:32:17,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:32:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:32:17,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:32:17,815 INFO L87 Difference]: Start difference. First operand 540 states and 650 transitions. Second operand 16 states. [2019-09-08 12:32:18,490 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-08 12:32:18,620 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:32:18,751 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-08 12:32:18,877 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 12:32:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:21,316 INFO L93 Difference]: Finished difference Result 972 states and 1175 transitions. [2019-09-08 12:32:21,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:32:21,317 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2019-09-08 12:32:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:21,318 INFO L225 Difference]: With dead ends: 972 [2019-09-08 12:32:21,319 INFO L226 Difference]: Without dead ends: 896 [2019-09-08 12:32:21,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:32:21,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-09-08 12:32:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 551. [2019-09-08 12:32:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-08 12:32:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 664 transitions. [2019-09-08 12:32:21,512 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 664 transitions. Word has length 107 [2019-09-08 12:32:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:21,512 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 664 transitions. [2019-09-08 12:32:21,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:32:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 664 transitions. [2019-09-08 12:32:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:21,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:21,514 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] [2019-09-08 12:32:21,514 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1048990583, now seen corresponding path program 1 times [2019-09-08 12:32:21,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:21,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:21,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:21,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:21,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:22,311 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:32:22,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:22,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 12:32:22,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:22,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:22,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:22,312 INFO L87 Difference]: Start difference. First operand 551 states and 664 transitions. Second operand 17 states. [2019-09-08 12:32:23,132 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-08 12:32:23,310 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-08 12:32:23,470 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:32:23,698 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-08 12:32:23,895 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-08 12:32:24,187 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-09-08 12:32:26,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:26,289 INFO L93 Difference]: Finished difference Result 1238 states and 1598 transitions. [2019-09-08 12:32:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:32:26,290 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2019-09-08 12:32:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:26,292 INFO L225 Difference]: With dead ends: 1238 [2019-09-08 12:32:26,292 INFO L226 Difference]: Without dead ends: 1125 [2019-09-08 12:32:26,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2019-09-08 12:32:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-09-08 12:32:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 513. [2019-09-08 12:32:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 12:32:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 616 transitions. [2019-09-08 12:32:26,489 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 616 transitions. Word has length 107 [2019-09-08 12:32:26,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:26,490 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 616 transitions. [2019-09-08 12:32:26,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 616 transitions. [2019-09-08 12:32:26,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-08 12:32:26,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:26,491 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] [2019-09-08 12:32:26,491 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:26,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:26,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1429007226, now seen corresponding path program 1 times [2019-09-08 12:32:26,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:26,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:26,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:26,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:26,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:26,893 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:32:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:26,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 12:32:26,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 12:32:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 12:32:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:32:26,894 INFO L87 Difference]: Start difference. First operand 513 states and 616 transitions. Second operand 11 states. [2019-09-08 12:32:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:28,527 INFO L93 Difference]: Finished difference Result 1131 states and 1415 transitions. [2019-09-08 12:32:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:28,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 107 [2019-09-08 12:32:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:28,529 INFO L225 Difference]: With dead ends: 1131 [2019-09-08 12:32:28,529 INFO L226 Difference]: Without dead ends: 917 [2019-09-08 12:32:28,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-09-08 12:32:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 374. [2019-09-08 12:32:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-08 12:32:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 446 transitions. [2019-09-08 12:32:28,663 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 446 transitions. Word has length 107 [2019-09-08 12:32:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:28,664 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 446 transitions. [2019-09-08 12:32:28,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 12:32:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 446 transitions. [2019-09-08 12:32:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:28,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:28,665 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] [2019-09-08 12:32:28,665 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash 47871049, now seen corresponding path program 1 times [2019-09-08 12:32:28,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:28,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:28,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:29,434 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:32:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:29,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:32:29,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:32:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:32:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:32:29,435 INFO L87 Difference]: Start difference. First operand 374 states and 446 transitions. Second operand 16 states. [2019-09-08 12:32:30,559 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 12:32:31,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:31,971 INFO L93 Difference]: Finished difference Result 773 states and 960 transitions. [2019-09-08 12:32:31,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 12:32:31,972 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:32:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:31,973 INFO L225 Difference]: With dead ends: 773 [2019-09-08 12:32:31,973 INFO L226 Difference]: Without dead ends: 694 [2019-09-08 12:32:31,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:32:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-08 12:32:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 370. [2019-09-08 12:32:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 12:32:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 441 transitions. [2019-09-08 12:32:32,107 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 441 transitions. Word has length 108 [2019-09-08 12:32:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:32,108 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 441 transitions. [2019-09-08 12:32:32,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:32:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 441 transitions. [2019-09-08 12:32:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:32,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:32,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] [2019-09-08 12:32:32,109 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2055568258, now seen corresponding path program 1 times [2019-09-08 12:32:32,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:32,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:32,732 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:32:32,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:32,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:32:32,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:32:32,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:32:32,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:32:32,733 INFO L87 Difference]: Start difference. First operand 370 states and 441 transitions. Second operand 13 states. [2019-09-08 12:32:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:35,361 INFO L93 Difference]: Finished difference Result 1490 states and 2005 transitions. [2019-09-08 12:32:35,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 12:32:35,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-08 12:32:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:35,364 INFO L225 Difference]: With dead ends: 1490 [2019-09-08 12:32:35,364 INFO L226 Difference]: Without dead ends: 1394 [2019-09-08 12:32:35,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2019-09-08 12:32:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 330. [2019-09-08 12:32:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-08 12:32:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 391 transitions. [2019-09-08 12:32:35,498 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 391 transitions. Word has length 108 [2019-09-08 12:32:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:35,498 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 391 transitions. [2019-09-08 12:32:35,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:32:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 391 transitions. [2019-09-08 12:32:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:35,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:35,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] [2019-09-08 12:32:35,499 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1742987955, now seen corresponding path program 1 times [2019-09-08 12:32:35,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:35,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:35,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:36,668 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:32:36,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:32:36,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:32:36,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:32:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:36,669 INFO L87 Difference]: Start difference. First operand 330 states and 391 transitions. Second operand 21 states. [2019-09-08 12:32:37,733 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:32:37,992 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 72 [2019-09-08 12:32:38,157 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:32:38,323 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 12:32:39,714 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-08 12:32:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:40,282 INFO L93 Difference]: Finished difference Result 692 states and 842 transitions. [2019-09-08 12:32:40,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 12:32:40,282 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-08 12:32:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:40,283 INFO L225 Difference]: With dead ends: 692 [2019-09-08 12:32:40,283 INFO L226 Difference]: Without dead ends: 613 [2019-09-08 12:32:40,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:32:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-08 12:32:40,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 355. [2019-09-08 12:32:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-09-08 12:32:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 421 transitions. [2019-09-08 12:32:40,423 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 421 transitions. Word has length 108 [2019-09-08 12:32:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:40,423 INFO L475 AbstractCegarLoop]: Abstraction has 355 states and 421 transitions. [2019-09-08 12:32:40,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:32:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 421 transitions. [2019-09-08 12:32:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:40,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:40,424 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] [2019-09-08 12:32:40,424 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1038357806, now seen corresponding path program 1 times [2019-09-08 12:32:40,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:40,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:41,183 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:32:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:41,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:32:41,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:32:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:32:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:32:41,197 INFO L87 Difference]: Start difference. First operand 355 states and 421 transitions. Second operand 16 states. [2019-09-08 12:32:41,900 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-08 12:32:42,045 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:32:42,188 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-08 12:32:42,362 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:32:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:43,765 INFO L93 Difference]: Finished difference Result 622 states and 736 transitions. [2019-09-08 12:32:43,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:32:43,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-08 12:32:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:43,766 INFO L225 Difference]: With dead ends: 622 [2019-09-08 12:32:43,767 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 12:32:43,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2019-09-08 12:32:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 12:32:43,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 362. [2019-09-08 12:32:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-08 12:32:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 430 transitions. [2019-09-08 12:32:43,954 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 430 transitions. Word has length 108 [2019-09-08 12:32:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:43,954 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 430 transitions. [2019-09-08 12:32:43,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:32:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 430 transitions. [2019-09-08 12:32:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:43,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:43,955 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] [2019-09-08 12:32:43,955 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash 109917810, now seen corresponding path program 1 times [2019-09-08 12:32:43,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:43,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:43,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:45,126 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:32:45,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:45,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 12:32:45,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 12:32:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 12:32:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:45,128 INFO L87 Difference]: Start difference. First operand 362 states and 430 transitions. Second operand 21 states. [2019-09-08 12:32:46,158 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 12:32:46,443 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-09-08 12:32:46,643 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:32:46,890 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:32:47,108 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-09-08 12:32:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:49,912 INFO L93 Difference]: Finished difference Result 722 states and 874 transitions. [2019-09-08 12:32:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:32:49,913 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 108 [2019-09-08 12:32:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:49,914 INFO L225 Difference]: With dead ends: 722 [2019-09-08 12:32:49,914 INFO L226 Difference]: Without dead ends: 715 [2019-09-08 12:32:49,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:32:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-09-08 12:32:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 362. [2019-09-08 12:32:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-08 12:32:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 429 transitions. [2019-09-08 12:32:50,064 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 429 transitions. Word has length 108 [2019-09-08 12:32:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:50,064 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 429 transitions. [2019-09-08 12:32:50,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 12:32:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 429 transitions. [2019-09-08 12:32:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-08 12:32:50,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:50,065 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] [2019-09-08 12:32:50,065 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:50,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1668741492, now seen corresponding path program 1 times [2019-09-08 12:32:50,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:50,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:50,537 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:32:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:50,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:32:50,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:32:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:32:50,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:32:50,538 INFO L87 Difference]: Start difference. First operand 362 states and 429 transitions. Second operand 13 states. [2019-09-08 12:32:52,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:52,407 INFO L93 Difference]: Finished difference Result 1062 states and 1369 transitions. [2019-09-08 12:32:52,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:32:52,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2019-09-08 12:32:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:52,409 INFO L225 Difference]: With dead ends: 1062 [2019-09-08 12:32:52,410 INFO L226 Difference]: Without dead ends: 908 [2019-09-08 12:32:52,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-08 12:32:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 282. [2019-09-08 12:32:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 12:32:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2019-09-08 12:32:52,535 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 108 [2019-09-08 12:32:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:52,535 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2019-09-08 12:32:52,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:32:52,535 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2019-09-08 12:32:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:32:52,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:52,536 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] [2019-09-08 12:32:52,536 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash 881258931, now seen corresponding path program 1 times [2019-09-08 12:32:52,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:52,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:52,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:52,680 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:32:52,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:52,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:52,681 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand 9 states. [2019-09-08 12:32:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:53,931 INFO L93 Difference]: Finished difference Result 634 states and 835 transitions. [2019-09-08 12:32:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:32:53,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-08 12:32:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:53,932 INFO L225 Difference]: With dead ends: 634 [2019-09-08 12:32:53,932 INFO L226 Difference]: Without dead ends: 539 [2019-09-08 12:32:53,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-08 12:32:53,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-08 12:32:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 282. [2019-09-08 12:32:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-08 12:32:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 336 transitions. [2019-09-08 12:32:54,059 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 336 transitions. Word has length 109 [2019-09-08 12:32:54,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:54,060 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 336 transitions. [2019-09-08 12:32:54,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 336 transitions. [2019-09-08 12:32:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 12:32:54,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:54,060 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] [2019-09-08 12:32:54,061 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1509496907, now seen corresponding path program 1 times [2019-09-08 12:32:54,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:54,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:54,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:54,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:54,637 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:32:54,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:54,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:32:54,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:32:54,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:32:54,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:32:54,638 INFO L87 Difference]: Start difference. First operand 282 states and 336 transitions. Second operand 13 states. [2019-09-08 12:32:55,128 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:32:55,257 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-09-08 12:32:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:56,528 INFO L93 Difference]: Finished difference Result 904 states and 1188 transitions. [2019-09-08 12:32:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:32:56,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-09-08 12:32:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:56,530 INFO L225 Difference]: With dead ends: 904 [2019-09-08 12:32:56,530 INFO L226 Difference]: Without dead ends: 780 [2019-09-08 12:32:56,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-08 12:32:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-09-08 12:32:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 220. [2019-09-08 12:32:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 12:32:56,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2019-09-08 12:32:56,641 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 109 [2019-09-08 12:32:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:56,641 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2019-09-08 12:32:56,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:32:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2019-09-08 12:32:56,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 12:32:56,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:56,642 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] [2019-09-08 12:32:56,643 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:56,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234167, now seen corresponding path program 1 times [2019-09-08 12:32:56,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:56,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:56,821 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:32:56,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:56,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 12:32:56,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 12:32:56,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 12:32:56,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:32:56,822 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand 9 states. [2019-09-08 12:32:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:57,655 INFO L93 Difference]: Finished difference Result 326 states and 406 transitions. [2019-09-08 12:32:57,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 12:32:57,655 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2019-09-08 12:32:57,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:57,656 INFO L225 Difference]: With dead ends: 326 [2019-09-08 12:32:57,656 INFO L226 Difference]: Without dead ends: 318 [2019-09-08 12:32:57,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:32:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-08 12:32:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 220. [2019-09-08 12:32:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-09-08 12:32:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 263 transitions. [2019-09-08 12:32:57,758 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 263 transitions. Word has length 110 [2019-09-08 12:32:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:57,759 INFO L475 AbstractCegarLoop]: Abstraction has 220 states and 263 transitions. [2019-09-08 12:32:57,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 12:32:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 263 transitions. [2019-09-08 12:32:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 12:32:57,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:57,760 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:57,760 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:57,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1677363192, now seen corresponding path program 1 times [2019-09-08 12:32:57,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:57,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:57,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:58,423 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:32:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 12:32:58,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 12:32:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 12:32:58,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-09-08 12:32:58,425 INFO L87 Difference]: Start difference. First operand 220 states and 263 transitions. Second operand 16 states. [2019-09-08 12:32:59,145 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 12:32:59,285 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:32:59,423 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 12:32:59,561 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-09-08 12:33:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:01,241 INFO L93 Difference]: Finished difference Result 711 states and 940 transitions. [2019-09-08 12:33:01,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 12:33:01,241 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 111 [2019-09-08 12:33:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:01,242 INFO L225 Difference]: With dead ends: 711 [2019-09-08 12:33:01,242 INFO L226 Difference]: Without dead ends: 705 [2019-09-08 12:33:01,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2019-09-08 12:33:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-09-08 12:33:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 255. [2019-09-08 12:33:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-08 12:33:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 305 transitions. [2019-09-08 12:33:01,365 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 305 transitions. Word has length 111 [2019-09-08 12:33:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:01,365 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 305 transitions. [2019-09-08 12:33:01,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 12:33:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 305 transitions. [2019-09-08 12:33:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:33:01,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:01,366 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] [2019-09-08 12:33:01,366 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1816444114, now seen corresponding path program 1 times [2019-09-08 12:33:01,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:01,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:02,109 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:33:02,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:02,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:33:02,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:33:02,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:33:02,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:33:02,110 INFO L87 Difference]: Start difference. First operand 255 states and 305 transitions. Second operand 13 states. [2019-09-08 12:33:03,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:03,649 INFO L93 Difference]: Finished difference Result 770 states and 1017 transitions. [2019-09-08 12:33:03,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 12:33:03,649 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-09-08 12:33:03,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:03,651 INFO L225 Difference]: With dead ends: 770 [2019-09-08 12:33:03,651 INFO L226 Difference]: Without dead ends: 750 [2019-09-08 12:33:03,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2019-09-08 12:33:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-09-08 12:33:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 235. [2019-09-08 12:33:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-09-08 12:33:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 283 transitions. [2019-09-08 12:33:03,777 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 283 transitions. Word has length 112 [2019-09-08 12:33:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:03,777 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 283 transitions. [2019-09-08 12:33:03,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:33:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 283 transitions. [2019-09-08 12:33:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 12:33:03,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:03,778 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] [2019-09-08 12:33:03,778 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash -285569651, now seen corresponding path program 1 times [2019-09-08 12:33:03,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:03,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:03,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:04,777 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 12:33:05,028 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-09-08 12:33:05,162 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 12:33:05,300 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-09-08 12:33:05,736 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-08 12:33:06,288 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-09-08 12:33:07,367 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:33:07,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:07,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-08 12:33:07,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-08 12:33:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-08 12:33:07,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:33:07,368 INFO L87 Difference]: Start difference. First operand 235 states and 283 transitions. Second operand 33 states. [2019-09-08 12:33:07,698 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-09-08 12:33:08,517 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-08 12:33:08,690 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-08 12:33:08,922 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:33:09,185 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-08 12:33:09,514 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2019-09-08 12:33:09,886 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-08 12:33:10,516 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-09-08 12:33:10,892 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 58 [2019-09-08 12:33:11,216 WARN L188 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-08 12:33:11,580 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2019-09-08 12:33:12,003 WARN L188 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 83 [2019-09-08 12:33:12,491 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 99 [2019-09-08 12:33:12,915 WARN L188 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-08 12:33:13,323 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2019-09-08 12:33:13,720 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 78 [2019-09-08 12:33:14,165 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 85 [2019-09-08 12:33:14,484 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2019-09-08 12:33:14,888 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-08 12:33:15,225 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-09-08 12:33:15,474 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-09-08 12:33:15,928 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-09-08 12:33:16,297 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 12:33:16,684 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-09-08 12:33:17,397 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-08 12:33:18,153 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2019-09-08 12:33:18,687 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-08 12:33:20,126 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-08 12:33:20,773 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-08 12:33:21,069 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-08 12:33:21,473 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-09-08 12:33:21,840 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-09-08 12:33:22,328 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-09-08 12:33:25,235 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2019-09-08 12:33:28,231 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 62 [2019-09-08 12:33:30,128 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-08 12:33:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:48,536 INFO L93 Difference]: Finished difference Result 2600 states and 3620 transitions. [2019-09-08 12:33:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 12:33:48,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 112 [2019-09-08 12:33:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:48,538 INFO L225 Difference]: With dead ends: 2600 [2019-09-08 12:33:48,538 INFO L226 Difference]: Without dead ends: 2594 [2019-09-08 12:33:48,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1029, Invalid=5451, Unknown=0, NotChecked=0, Total=6480 [2019-09-08 12:33:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2019-09-08 12:33:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 253. [2019-09-08 12:33:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-08 12:33:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 304 transitions. [2019-09-08 12:33:48,695 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 304 transitions. Word has length 112 [2019-09-08 12:33:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:48,695 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 304 transitions. [2019-09-08 12:33:48,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-08 12:33:48,696 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 304 transitions. [2019-09-08 12:33:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 12:33:48,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:48,696 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] [2019-09-08 12:33:48,696 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:48,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash -310268750, now seen corresponding path program 1 times [2019-09-08 12:33:48,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:48,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:49,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:49,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 12:33:49,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 12:33:49,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 12:33:49,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:33:49,313 INFO L87 Difference]: Start difference. First operand 253 states and 304 transitions. Second operand 13 states. [2019-09-08 12:33:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:50,404 INFO L93 Difference]: Finished difference Result 516 states and 677 transitions. [2019-09-08 12:33:50,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 12:33:50,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2019-09-08 12:33:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:50,405 INFO L225 Difference]: With dead ends: 516 [2019-09-08 12:33:50,405 INFO L226 Difference]: Without dead ends: 510 [2019-09-08 12:33:50,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-09-08 12:33:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-08 12:33:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 194. [2019-09-08 12:33:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-08 12:33:50,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2019-09-08 12:33:50,522 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 113 [2019-09-08 12:33:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:50,522 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2019-09-08 12:33:50,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 12:33:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2019-09-08 12:33:50,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 12:33:50,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:50,523 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:50,523 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 846487170, now seen corresponding path program 1 times [2019-09-08 12:33:50,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:50,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:50,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:50,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:50,636 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:33:50,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:50,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:33:50,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:33:50,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:33:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:50,637 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand 3 states. [2019-09-08 12:33:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:50,876 INFO L93 Difference]: Finished difference Result 340 states and 448 transitions. [2019-09-08 12:33:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:33:50,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 12:33:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:50,877 INFO L225 Difference]: With dead ends: 340 [2019-09-08 12:33:50,877 INFO L226 Difference]: Without dead ends: 265 [2019-09-08 12:33:50,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-09-08 12:33:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2019-09-08 12:33:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-08 12:33:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2019-09-08 12:33:51,064 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 144 [2019-09-08 12:33:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:51,064 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2019-09-08 12:33:51,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:33:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2019-09-08 12:33:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:33:51,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:51,066 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:51,066 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:51,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1179395723, now seen corresponding path program 1 times [2019-09-08 12:33:51,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:51,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:51,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:51,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:33:51,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:51,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:33:51,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:33:51,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:33:51,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:33:51,225 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand 7 states. [2019-09-08 12:33:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:52,190 INFO L93 Difference]: Finished difference Result 711 states and 978 transitions. [2019-09-08 12:33:52,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:33:52,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:33:52,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:52,191 INFO L225 Difference]: With dead ends: 711 [2019-09-08 12:33:52,191 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 12:33:52,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:33:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 12:33:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 295. [2019-09-08 12:33:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-08 12:33:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 379 transitions. [2019-09-08 12:33:52,419 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 379 transitions. Word has length 146 [2019-09-08 12:33:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:52,419 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 379 transitions. [2019-09-08 12:33:52,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:33:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 379 transitions. [2019-09-08 12:33:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:33:52,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:52,420 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1500507275, now seen corresponding path program 1 times [2019-09-08 12:33:52,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:52,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:52,559 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:33:52,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:52,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:33:52,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:33:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:33:52,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:33:52,560 INFO L87 Difference]: Start difference. First operand 295 states and 379 transitions. Second operand 7 states. [2019-09-08 12:33:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:53,977 INFO L93 Difference]: Finished difference Result 1103 states and 1535 transitions. [2019-09-08 12:33:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:33:53,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:33:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:53,978 INFO L225 Difference]: With dead ends: 1103 [2019-09-08 12:33:53,979 INFO L226 Difference]: Without dead ends: 927 [2019-09-08 12:33:53,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:33:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-09-08 12:33:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 489. [2019-09-08 12:33:54,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-09-08 12:33:54,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 659 transitions. [2019-09-08 12:33:54,418 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 659 transitions. Word has length 146 [2019-09-08 12:33:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:54,418 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 659 transitions. [2019-09-08 12:33:54,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:33:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 659 transitions. [2019-09-08 12:33:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:33:54,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:54,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:54,419 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash -656987622, now seen corresponding path program 1 times [2019-09-08 12:33:54,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:54,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:54,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:54,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:54,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:54,536 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:33:54,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:54,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:33:54,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:33:54,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:33:54,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:54,537 INFO L87 Difference]: Start difference. First operand 489 states and 659 transitions. Second operand 3 states. [2019-09-08 12:33:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:55,231 INFO L93 Difference]: Finished difference Result 1053 states and 1473 transitions. [2019-09-08 12:33:55,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:33:55,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:33:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:55,233 INFO L225 Difference]: With dead ends: 1053 [2019-09-08 12:33:55,233 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 12:33:55,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 12:33:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2019-09-08 12:33:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-08 12:33:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 931 transitions. [2019-09-08 12:33:55,877 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 931 transitions. Word has length 146 [2019-09-08 12:33:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:55,877 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 931 transitions. [2019-09-08 12:33:55,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:33:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 931 transitions. [2019-09-08 12:33:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:33:55,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:55,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:55,879 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash -723481134, now seen corresponding path program 1 times [2019-09-08 12:33:55,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:56,041 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:33:56,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:56,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:33:56,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:33:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:33:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:56,043 INFO L87 Difference]: Start difference. First operand 681 states and 931 transitions. Second operand 3 states. [2019-09-08 12:33:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:57,284 INFO L93 Difference]: Finished difference Result 1743 states and 2443 transitions. [2019-09-08 12:33:57,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:33:57,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 12:33:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:57,286 INFO L225 Difference]: With dead ends: 1743 [2019-09-08 12:33:57,286 INFO L226 Difference]: Without dead ends: 1181 [2019-09-08 12:33:57,287 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:33:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-09-08 12:33:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1179. [2019-09-08 12:33:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2019-09-08 12:33:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1621 transitions. [2019-09-08 12:33:58,526 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1621 transitions. Word has length 146 [2019-09-08 12:33:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:58,526 INFO L475 AbstractCegarLoop]: Abstraction has 1179 states and 1621 transitions. [2019-09-08 12:33:58,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:33:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1621 transitions. [2019-09-08 12:33:58,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:33:58,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:58,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:33:58,528 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 803696779, now seen corresponding path program 1 times [2019-09-08 12:33:58,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:58,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:58,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:58,665 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:33:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:33:58,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:33:58,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:33:58,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:33:58,666 INFO L87 Difference]: Start difference. First operand 1179 states and 1621 transitions. Second operand 7 states. [2019-09-08 12:34:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:03,747 INFO L93 Difference]: Finished difference Result 5171 states and 7241 transitions. [2019-09-08 12:34:03,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:34:03,748 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:34:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:03,752 INFO L225 Difference]: With dead ends: 5171 [2019-09-08 12:34:03,753 INFO L226 Difference]: Without dead ends: 4111 [2019-09-08 12:34:03,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:34:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4111 states. [2019-09-08 12:34:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4111 to 2357. [2019-09-08 12:34:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2357 states. [2019-09-08 12:34:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3283 transitions. [2019-09-08 12:34:06,290 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3283 transitions. Word has length 146 [2019-09-08 12:34:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 2357 states and 3283 transitions. [2019-09-08 12:34:06,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:34:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3283 transitions. [2019-09-08 12:34:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:34:06,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:06,292 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:06,292 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1196216693, now seen corresponding path program 1 times [2019-09-08 12:34:06,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:06,429 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:34:06,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:06,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:34:06,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:34:06,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:34:06,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:34:06,430 INFO L87 Difference]: Start difference. First operand 2357 states and 3283 transitions. Second operand 7 states. [2019-09-08 12:34:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:15,548 INFO L93 Difference]: Finished difference Result 9817 states and 13787 transitions. [2019-09-08 12:34:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:34:15,548 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:34:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:15,556 INFO L225 Difference]: With dead ends: 9817 [2019-09-08 12:34:15,556 INFO L226 Difference]: Without dead ends: 7579 [2019-09-08 12:34:15,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:34:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2019-09-08 12:34:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 4833. [2019-09-08 12:34:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4833 states. [2019-09-08 12:34:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4833 states to 4833 states and 6775 transitions. [2019-09-08 12:34:20,831 INFO L78 Accepts]: Start accepts. Automaton has 4833 states and 6775 transitions. Word has length 146 [2019-09-08 12:34:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:20,831 INFO L475 AbstractCegarLoop]: Abstraction has 4833 states and 6775 transitions. [2019-09-08 12:34:20,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:34:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4833 states and 6775 transitions. [2019-09-08 12:34:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:34:20,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:20,833 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1315067253, now seen corresponding path program 1 times [2019-09-08 12:34:20,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:20,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:20,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:20,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:20,973 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:34:20,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:20,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:34:20,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:34:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:34:20,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:34:20,974 INFO L87 Difference]: Start difference. First operand 4833 states and 6775 transitions. Second operand 7 states. [2019-09-08 12:34:40,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:40,435 INFO L93 Difference]: Finished difference Result 21905 states and 30899 transitions. [2019-09-08 12:34:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:34:40,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:34:40,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:40,450 INFO L225 Difference]: With dead ends: 21905 [2019-09-08 12:34:40,450 INFO L226 Difference]: Without dead ends: 17191 [2019-09-08 12:34:40,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:34:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17191 states. [2019-09-08 12:34:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17191 to 10025. [2019-09-08 12:34:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10025 states. [2019-09-08 12:34:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10025 states to 10025 states and 14095 transitions. [2019-09-08 12:34:51,438 INFO L78 Accepts]: Start accepts. Automaton has 10025 states and 14095 transitions. Word has length 146 [2019-09-08 12:34:51,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:51,438 INFO L475 AbstractCegarLoop]: Abstraction has 10025 states and 14095 transitions. [2019-09-08 12:34:51,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:34:51,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10025 states and 14095 transitions. [2019-09-08 12:34:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 12:34:51,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:51,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:34:51,441 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:51,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1598265205, now seen corresponding path program 1 times [2019-09-08 12:34:51,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:51,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:51,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:51,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:51,583 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:34:51,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:51,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 12:34:51,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 12:34:51,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 12:34:51,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 12:34:51,584 INFO L87 Difference]: Start difference. First operand 10025 states and 14095 transitions. Second operand 7 states. [2019-09-08 12:35:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:23,795 INFO L93 Difference]: Finished difference Result 38709 states and 54614 transitions. [2019-09-08 12:35:23,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:35:23,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-08 12:35:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:23,823 INFO L225 Difference]: With dead ends: 38709 [2019-09-08 12:35:23,823 INFO L226 Difference]: Without dead ends: 28803 [2019-09-08 12:35:23,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 12:35:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28803 states. [2019-09-08 12:35:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28803 to 16473. [2019-09-08 12:35:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16473 states. [2019-09-08 12:35:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16473 states to 16473 states and 23167 transitions. [2019-09-08 12:35:43,285 INFO L78 Accepts]: Start accepts. Automaton has 16473 states and 23167 transitions. Word has length 146 [2019-09-08 12:35:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:43,285 INFO L475 AbstractCegarLoop]: Abstraction has 16473 states and 23167 transitions. [2019-09-08 12:35:43,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 12:35:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 16473 states and 23167 transitions. [2019-09-08 12:35:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:35:43,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:43,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:35:43,288 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:43,289 INFO L82 PathProgramCache]: Analyzing trace with hash 661211626, now seen corresponding path program 1 times [2019-09-08 12:35:43,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:43,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:43,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:43,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:43,424 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:35:43,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:43,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 12:35:43,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 12:35:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 12:35:43,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:35:43,425 INFO L87 Difference]: Start difference. First operand 16473 states and 23167 transitions. Second operand 6 states. [2019-09-08 12:36:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:36:14,691 INFO L93 Difference]: Finished difference Result 27326 states and 38058 transitions. [2019-09-08 12:36:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 12:36:14,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-08 12:36:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:36:14,717 INFO L225 Difference]: With dead ends: 27326 [2019-09-08 12:36:14,717 INFO L226 Difference]: Without dead ends: 27324 [2019-09-08 12:36:14,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 12:36:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27324 states. [2019-09-08 12:36:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27324 to 16665. [2019-09-08 12:36:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-09-08 12:36:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 23295 transitions. [2019-09-08 12:36:33,341 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 23295 transitions. Word has length 147 [2019-09-08 12:36:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:33,341 INFO L475 AbstractCegarLoop]: Abstraction has 16665 states and 23295 transitions. [2019-09-08 12:36:33,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 12:36:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 23295 transitions. [2019-09-08 12:36:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 12:36:33,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:33,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:36:33,344 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:33,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:33,344 INFO L82 PathProgramCache]: Analyzing trace with hash -935556183, now seen corresponding path program 1 times [2019-09-08 12:36:33,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:33,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:33,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:33,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:33,462 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:36:33,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:33,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:36:33,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:36:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:36:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:36:33,464 INFO L87 Difference]: Start difference. First operand 16665 states and 23295 transitions. Second operand 3 states. [2019-09-08 12:37:03,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:03,348 INFO L93 Difference]: Finished difference Result 43725 states and 61585 transitions. [2019-09-08 12:37:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:03,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-08 12:37:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:03,375 INFO L225 Difference]: With dead ends: 43725 [2019-09-08 12:37:03,375 INFO L226 Difference]: Without dead ends: 27179 [2019-09-08 12:37:03,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27179 states. [2019-09-08 12:37:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27179 to 19873. [2019-09-08 12:37:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19873 states. [2019-09-08 12:37:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19873 states to 19873 states and 27991 transitions. [2019-09-08 12:37:25,397 INFO L78 Accepts]: Start accepts. Automaton has 19873 states and 27991 transitions. Word has length 147 [2019-09-08 12:37:25,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:25,397 INFO L475 AbstractCegarLoop]: Abstraction has 19873 states and 27991 transitions. [2019-09-08 12:37:25,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:37:25,397 INFO L276 IsEmpty]: Start isEmpty. Operand 19873 states and 27991 transitions. [2019-09-08 12:37:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 12:37:25,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:25,400 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:25,400 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:25,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash 992244541, now seen corresponding path program 1 times [2019-09-08 12:37:25,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:25,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:25,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:25,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:25,507 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:37:25,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:25,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:25,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:25,508 INFO L87 Difference]: Start difference. First operand 19873 states and 27991 transitions. Second operand 3 states. [2019-09-08 12:37:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:37:47,176 INFO L93 Difference]: Finished difference Result 38333 states and 53913 transitions. [2019-09-08 12:37:47,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:37:47,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-08 12:37:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:37:47,193 INFO L225 Difference]: With dead ends: 38333 [2019-09-08 12:37:47,193 INFO L226 Difference]: Without dead ends: 18579 [2019-09-08 12:37:47,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18579 states. [2019-09-08 12:38:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18579 to 14125. [2019-09-08 12:38:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14125 states. [2019-09-08 12:38:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14125 states to 14125 states and 19621 transitions. [2019-09-08 12:38:04,324 INFO L78 Accepts]: Start accepts. Automaton has 14125 states and 19621 transitions. Word has length 148 [2019-09-08 12:38:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:04,325 INFO L475 AbstractCegarLoop]: Abstraction has 14125 states and 19621 transitions. [2019-09-08 12:38:04,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:38:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14125 states and 19621 transitions. [2019-09-08 12:38:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 12:38:04,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:04,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:04,326 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:04,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 536479185, now seen corresponding path program 1 times [2019-09-08 12:38:04,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:04,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:04,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:04,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:38:04,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:04,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:38:04,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:38:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:38:04,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:38:04,434 INFO L87 Difference]: Start difference. First operand 14125 states and 19621 transitions. Second operand 3 states. [2019-09-08 12:38:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:25,677 INFO L93 Difference]: Finished difference Result 31775 states and 44073 transitions. [2019-09-08 12:38:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:38:25,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-09-08 12:38:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:25,693 INFO L225 Difference]: With dead ends: 31775 [2019-09-08 12:38:25,693 INFO L226 Difference]: Without dead ends: 17769 [2019-09-08 12:38:25,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:38:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17769 states. [2019-09-08 12:38:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17769 to 17119. [2019-09-08 12:38:45,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17119 states. [2019-09-08 12:38:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17119 states to 17119 states and 23623 transitions. [2019-09-08 12:38:45,640 INFO L78 Accepts]: Start accepts. Automaton has 17119 states and 23623 transitions. Word has length 149 [2019-09-08 12:38:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:45,641 INFO L475 AbstractCegarLoop]: Abstraction has 17119 states and 23623 transitions. [2019-09-08 12:38:45,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:38:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 17119 states and 23623 transitions. [2019-09-08 12:38:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 12:38:45,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:45,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:38:45,642 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -251713815, now seen corresponding path program 1 times [2019-09-08 12:38:45,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:45,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:45,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:45,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:45,757 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:38:45,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:45,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:38:45,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:38:45,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:38:45,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:38:45,758 INFO L87 Difference]: Start difference. First operand 17119 states and 23623 transitions. Second operand 3 states. [2019-09-08 12:39:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:05,528 INFO L93 Difference]: Finished difference Result 33473 states and 46185 transitions. [2019-09-08 12:39:05,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:05,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-09-08 12:39:05,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:05,543 INFO L225 Difference]: With dead ends: 33473 [2019-09-08 12:39:05,543 INFO L226 Difference]: Without dead ends: 16473 [2019-09-08 12:39:05,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16473 states. [2019-09-08 12:39:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16473 to 16471. [2019-09-08 12:39:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16471 states. [2019-09-08 12:39:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16471 states to 16471 states and 22567 transitions. [2019-09-08 12:39:26,091 INFO L78 Accepts]: Start accepts. Automaton has 16471 states and 22567 transitions. Word has length 150 [2019-09-08 12:39:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:26,092 INFO L475 AbstractCegarLoop]: Abstraction has 16471 states and 22567 transitions. [2019-09-08 12:39:26,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:39:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 16471 states and 22567 transitions. [2019-09-08 12:39:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 12:39:26,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:26,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:39:26,093 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1150986759, now seen corresponding path program 1 times [2019-09-08 12:39:26,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:26,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:26,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:26,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:26,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:26,287 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:39:26,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:26,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:26,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:26,289 INFO L87 Difference]: Start difference. First operand 16471 states and 22567 transitions. Second operand 3 states. [2019-09-08 12:39:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:48,308 INFO L93 Difference]: Finished difference Result 34439 states and 47273 transitions. [2019-09-08 12:39:48,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:48,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 12:39:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:48,325 INFO L225 Difference]: With dead ends: 34439 [2019-09-08 12:39:48,326 INFO L226 Difference]: Without dead ends: 18087 [2019-09-08 12:39:48,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18087 states. [2019-09-08 12:40:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18087 to 18085. [2019-09-08 12:40:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18085 states. [2019-09-08 12:40:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18085 states to 18085 states and 24735 transitions. [2019-09-08 12:40:09,778 INFO L78 Accepts]: Start accepts. Automaton has 18085 states and 24735 transitions. Word has length 151 [2019-09-08 12:40:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:09,778 INFO L475 AbstractCegarLoop]: Abstraction has 18085 states and 24735 transitions. [2019-09-08 12:40:09,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18085 states and 24735 transitions. [2019-09-08 12:40:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 12:40:09,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:09,781 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,781 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:09,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1877475909, now seen corresponding path program 1 times [2019-09-08 12:40:09,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:09,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:10,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:40:10,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:40:10,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 12:40:10,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:10,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 12:40:10,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:40:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 12:40:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 12:40:11,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2019-09-08 12:40:11,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 12:40:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 12:40:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-09-08 12:40:11,074 INFO L87 Difference]: Start difference. First operand 18085 states and 24735 transitions. Second operand 18 states. [2019-09-08 12:40:11,893 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-08 12:40:12,891 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 12:40:17,275 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:40:18,738 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:40:18,900 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-08 12:40:19,178 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:40:20,608 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 12:40:21,039 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-09-08 12:40:22,051 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-08 12:40:23,282 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2019-09-08 12:40:28,978 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:40:29,128 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 12:40:29,615 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-08 12:40:36,306 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54